Publication:3773860
From MaRDI portal
zbMath0635.03033MaRDI QIDQ3773860
A. J. Wilkie, Jeffrey Bruce Paris, W. G. Handley
Publication date: 1986
arithmetic functions; space complexity classes; stack register machines; polynomially bounded quantifiers; closed under counting
68Q25: Analysis of algorithms and problem complexity
03D15: Complexity of computation (including implicit computational complexity)
Related Items
Counting modulo finite semigroups, Computation models and function algebras, Nondeterministic stack register machines, Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\), Nonerasing, counting, and majority over the linear time hierarchy