scientific article
From MaRDI portal
Publication:3140635
zbMath0793.03046MaRDI QIDQ3140635
Publication date: 21 August 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) Complexity of proofs (03F20)
Related Items (8)
Function-algebraic characterizations of log and polylog parallel time ⋮ The equivalence of theories that characterize ALogTime ⋮ Computation models and function algebras ⋮ On the finite axiomatizability of ⋮ A bounded arithmetic AID for Frege systems ⋮ Tractability of cut-free Gentzen type propositional calculus with permutation inference ⋮ Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\) ⋮ On a Theory for AC0 and the Strength of the Induction Scheme
This page was built for publication:
