scientific article
From MaRDI portal
Publication:3941393
zbMath0483.03024MaRDI QIDQ3941393
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items
Quadratic forms in models of \(I\Delta _{0}+\Omega _{1}\). I, On the scheme of induction for bounded arithmetic formulas, Pell equations and exponentiation in fragments of arithmetic, Rudimentary reductions revisited, The graph of multiplication is equivalent to counting, The role of rudimentary relations in complexity theory, Bounded arithmetic, proof complexity and two papers of Parikh, Polynomial time computations in models of ET
