scientific article; zbMATH DE number 408812
From MaRDI portal
Publication:4202957
zbMath0819.68066MaRDI QIDQ4202957
Publication date: 6 September 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (5)
Monotonicity and the Expressibility of NP Operators ⋮ Methods for proving completeness via logical reductions ⋮ Succinct representation, leaf languages, and projection reductions ⋮ Succinctness as a source of complexity in logical formalisms ⋮ Context-sensitive transitive closure operators
This page was built for publication: