scientific article; zbMATH DE number 3995646
From MaRDI portal
Publication:4723712
zbMath0615.03022MaRDI QIDQ4723712
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
bounded arithmeticalternating Turing machine\(\Delta _ 0\)-hierarchyalternations of bounded quantifiersconstant alternationfirst-order arithmetic with bounded quantifiers
Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Turing machines and related notions (03D10)
Related Items (3)
Transfinite induction within Peano arithmetic ⋮ Computation models and function algebras ⋮ Time-space tradeoffs for satisfiability
This page was built for publication:
