Publication:3775538
From MaRDI portal
zbMath0636.03033MaRDI QIDQ3775538
Publication date: 1987
03D15: Complexity of computation (including implicit computational complexity)
Related Items
Unnamed Item, Games for Inclusion Logic and Fixed-Point Logic, Generalized hex and logical characterizations of polynomial space, The expressive power of stratified logic programs, Datalog extensions for database queries and updates, Why not negation by fixpoint?, Capturing complexity classes by fragments of second-order logic, Positive versions of polynomial time, Stratified least fixpoint logic, Non-determinism in logic-based languages, Hierarchies in transitive closure logic, stratified Datalog and infinitary logic, Dependence logic with generalized quantifiers: axiomatizations, Parameterized Complexity Classes under Logical Reductions