A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes

DOI10.1016/S0020-0190(99)00011-3MaRDI QIDQ294649zbMATH OpenOpenAlexFDO

Authors Jin-Yi Cai

Publication date 16 June 2016

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

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019099000113?np=y

zbMATH Keywords

computational complexityfault tolerance

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Restricted relativizations of probabilistic polynomial time
• On bounded-probability operators and C\(_ =\)P
• Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
• Probabilistic complexity classes and lowness
• scientific article; zbMATH DE number 638299

Cites work

• A decisive characterization of BPP
• A sample of samplers: a computational perspective on sampling
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• BPP and the polynomial hierarchy
• Complexity Measures for Public-Key Cryptosystems
• scientific article; zbMATH DE number 1304314 (Why is no real title available?)
• scientific article; zbMATH DE number 512802 (Why is no real title available?)
• scientific article; zbMATH DE number 1104167 (Why is no real title available?)
• Simulating BPP using a general weak random source
• The complexity of promise problems with applications to public-key cryptography
• Weak Random Sources, Hitting Sets, and BPP Simulations

Cited in

(2)

• With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
• FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS

This page was built for publication: A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes

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