scientific article
From MaRDI portal
zbMath0588.03024MaRDI QIDQ3715098
Peter G. Hinman, Stathis Zachos
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Turing machinesPSPACENPBPPpolynomial-time complexity classesbounded error probabilistic polynomial timepolynomially bounded quantifiersprobabilistic quantifiersquantifier- classes
Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)
Related Items
Does co-NP have short interactive proofs ?, Probabilistic quantifiers and games, A uniform approach to define complexity classes
