scientific article; zbMATH DE number 3943795

MaRDI QIDQ3715098zbMATH OpenFDO

Authors Peter G. Hinman, Stathis Zachos

Publication date 1985

zbMATH Keywords

PSPACETuring machinesNPBPPpolynomial-time complexity classesbounded error probabilistic polynomial timepolynomially bounded quantifiersprobabilistic quantifiersquantifier- classes

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)

Recommendations

• Probabilistic quantifiers and games
• A decisive characterization of BPP
• Restricted relativizations of probabilistic polynomial time
• scientific article; zbMATH DE number 4011940
• scientific article; zbMATH DE number 3880118

Cited in

(13)

• scientific article; zbMATH DE number 7075880 (Why is no real title available?)
• A uniform approach to define complexity classes
• Operational characterization of weight-based resource quantifiers via exclusion tasks in general probabilistic theories
• scientific article; zbMATH DE number 4057011 (Why is no real title available?)
• scientific article; zbMATH DE number 4027449 (Why is no real title available?)
• Probabilistic quantifiers and games
• Restricted relativizations of probabilistic polynomial time
• scientific article; zbMATH DE number 2102762 (Why is no real title available?)
• Probabilistic complexity classes and lowness
• Does co-NP have short interactive proofs ?
• A decisive characterization of BPP
• Complexity classes of equivalence problems revisited
• Error-bounded probabilistic computations between MA and AM

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3715098)