scientific article; zbMATH DE number 2196512
From MaRDI portal
Publication:5465359
zbMath1084.03044MaRDI QIDQ5465359
Publication date: 22 August 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20)
Related Items (8)
The equivalence of theories that characterize ALogTime ⋮ Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) ⋮ Generalized quantifier and a bounded arithmetic theory for LOGCFL ⋮ On theories of bounded arithmetic for \(\mathrm{NC}^1\) ⋮ A Tight Karp-Lipton Collapse Result in Bounded Arithmetic ⋮ On the correspondence between arithmetic theories and propositional proof systems – a survey ⋮ Short propositional refutations for dense random 3CNF formulas ⋮ A Groupoid of Isomorphic Data Transformations
This page was built for publication:
