Searching for authors named "Neil Immerman" – sorted by Relevance.
-
Descriptive Complexity: a Logician's Approach to Computation
- Descriptive Complexity: a Logician's Approach to Computation Neil Immerman Computer Science Dept
- Cited by 11 (1 self) – Add To MetaCart
-
Descriptive and Computational Complexity
- Descriptive and Computational Complexity Neil Immerman y Computer Science Department University
- Cited by 50 (0 self) – Add To MetaCart
-
Nondeterministic Space is Closed Under Complementation
- Nondeterministic Space is Closed Under Complementation Neil Immerman Computer Science Department
- Cited by 213 (16 self) – Add To MetaCart
-
Relational Queries Computable in Polynomial Time
- Relational Queries Computable in Polynomial Time Neil Immerman Computer Science Department Yale
- Cited by 247 (17 self) – Add To MetaCart
-
DSPACE[n^k] = VAR[k+1]
- DSPACE[n k ] = VAR[k + 1] Neil Immerman Computer Science Dept. University of Massachusetts
- Cited by 14 (9 self) – Add To MetaCart
-
Languages That Capture Complexity Classes
- Languages That Capture Complexity Classes Neil Immerman y Introduction We present in this paper
- Cited by 217 (22 self) – Add To MetaCart
-
The Complexity of Iterated Multiplication
- The Complexity of Iterated Multiplication Neil Immerman and Susan Landau y Computer Science
- Cited by 40 (4 self) – Add To MetaCart
-
Reachability Logic: An Efficient Fragment of Transitive Closure Logic
- of Computer Science and IT, University of Nottingham, UK. E-mail: nza@(email omitted); NEIL IMMERMAN, Computer
- Cited by 10 (0 self) – Add To MetaCart
-
The Similarities (and Differences) between Polynomials and Integers
- The Similarities (and Differences) between Polynomials and Integers Susan Landau and Neil
- Cited by 1 (0 self) – Add To MetaCart
-
Complete Problems for Dynamic Complexity Classes
- , Amherst, USA www.cs.umass.edu/#whesse Neil Immerman # Computer Science Dept. UMass, Amherst, USA www.cs.umass.edu/#immerman
- Cited by 8 (3 self) – Add To MetaCart

