scientific article; zbMATH DE number 806747
From MaRDI portal
Publication:4850548
zbMath0838.03043MaRDI QIDQ4850548
Publication date: 6 June 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
The equivalence of theories that characterize ALogTime, Separations of theories in weak bounded arithmetic, Regressive computations characterize logarithmic space, Corrigendum to: ``Uniform constant-depth threshold circuits for division and iterated multiplication, Nondeterministic stack register machines, On the coincidence of complexity classes BPC and \(\text{TC}^0 \), Computation models and function algebras, On the finite axiomatizability of, New substitution bases for complexity classes, On End‐Extensions of Models of ¬exp, Bounded theories for polyspace computability, \(S_{k,\text{exp}}\) does not prove \(\text{NP} = \text{co-NP}\) uniformly, A bounded arithmetic AID for Frege systems, A theory for Log-Space and NLIN versus co-NLIN, Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\), Strengths and Weaknesses of LH Arithmetic, The counting hierarchy in binary notation, Induction rules in bounded arithmetic, Frege proof system and TNC°, On a Theory for AC0 and the Strength of the Induction Scheme, The weak pigeonhole principle for function classes inS12, Some results on cut-elimination, provable well-orderings, induction and reflection, A note on sharply bounded arithmetic
