A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes
From MaRDI portal
Publication:294649
DOI10.1016/S0020-0190(99)00011-3zbMath1338.68081OpenAlexW2053654064MaRDI QIDQ294649
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
Related Items
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