scientific article; zbMATH DE number 1420845
From MaRDI portal
Publication:4944913
zbMath0988.03088MaRDI QIDQ4944913
Publication date: 14 July 2002
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 (8)
Iterated multiplication in \(VTC^0\) ⋮ On the finite axiomatizability of ⋮ Elementary analytic functions in \(\mathsf{VT}\mathsf{C}^0\) ⋮ Construction of models of bounded arithmetic by restricted reduced powers ⋮ A theory for Log-Space and NLIN versus co-NLIN ⋮ Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\) ⋮ Induction rules in bounded arithmetic ⋮ Open induction in a bounded arithmetic for \(\mathrm{TC}^{0}\)
This page was built for publication:
