Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Immerman, Neil - Department of Computer Science, University of Massachusetts at Amherst
0 About this document Godel's famous proof [2, 1] is highly interesting, but may be hard to understand. Some
Languages Which Capture Complexity Classes (Preliminary Report)
*LENGTH OF PREDICATE CALCULUS FORMULAS AS A NEW COMPLEXITY MEASURE Neil Immerman
Upper and Lower Bounds for First Order Expressibility Neil Immennan
