scientific article
From MaRDI portal
zbMath0635.03033MaRDI QIDQ3773860
A. J. Wilkie, Jeffrey Bruce Paris, W. G. Handley
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
arithmetic functionsspace complexity classesstack register machinespolynomially bounded quantifiersclosed under counting
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
Nondeterministic stack register machines, Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\), Computation models and function algebras, Counting modulo finite semigroups, Nonerasing, counting, and majority over the linear time hierarchy