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

DOI10.1016/S0020-0190(99)00011-3zbMath1338.68081OpenAlexW2053654064MaRDI QIDQ294649

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)

Related Items

FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• BPP and the polynomial hierarchy
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• Simulating BPP using a general weak random source
• A Sample of Samplers: A Computational Perspective on Sampling
• The complexity of promise problems with applications to public-key cryptography
• Complexity Measures for Public-Key Cryptosystems
• Weak Random Sources, Hitting Sets, and BPP Simulations
• A decisive characterization of BPP