Publication:3715098
From MaRDI portal
zbMath0588.03024MaRDI QIDQ3715098
Stathis Zachos, Peter G. Hinman
Publication date: 1985
Turing machines; PSPACE; NP; BPP; polynomial-time complexity classes; bounded error probabilistic polynomial time; polynomially bounded quantifiers; probabilistic quantifiers; quantifier- classes
03D15: Complexity of computation (including implicit computational complexity)
03D10: Turing machines and related notions
Related Items
Does co-NP have short interactive proofs ?, Probabilistic quantifiers and games, A uniform approach to define complexity classes