On bounded-probability operators and C\(_ =\)P

DOI10.1016/0020-0190(93)90184-BzbMath0797.68063OpenAlexW2076477476MaRDI QIDQ1313771

Sanjay Gupta

Publication date: 24 February 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90184-b

zbMATH Keywords

computational complexitypolynomial-time hierarchyprobabilistic classes

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• BPP and the polynomial hierarchy
• Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
• A decisive characterization of BPP

This page was built for publication: On bounded-probability operators and C\(_ =\)P