scientific article; zbMATH DE number 512825
From MaRDI portal
Publication:4281518
zbMath0799.68088MaRDI QIDQ4281518
José L. Balcázar, Neil Immerman, Eric W. Allender
Publication date: 10 March 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Counting quantifiers, successor relations, and logarithmic space ⋮ Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second - Order Logic ⋮ Logics with Zero-One Laws that Are Not Fragments of Bounded-Variable Infinitary Logic ⋮ Complete problems for monotone NP ⋮ A constant-space sequential model of computation for first-order logic ⋮ Succinct representation, leaf languages, and projection reductions ⋮ For completeness, sublogarithmic space is no space.
