One-sided versus two-sided error in probabilistic computation

Authors:
Harry Buhrman;Lance Fortnow
Affiliations:
CWI, Amsterdam, The Netherlands;University of Chicago, Department of Computer Science, Chicago, IL
Venue:
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Year:
1999

Citing 8
Cited 10

On relativized exponential and probabilistic complexity classes

Information and Control
Complexity measures for public-key cryptosystems

SIAM Journal on Computing - Special issue on cryptography
Probabilistic quantifiers and games

Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
CREW PRAMs and decision trees

SIAM Journal on Computing
A new general derandomization method

Journal of the ACM (JACM)
Weak random sources, hitting sets, and BPP simulations

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A complexity theoretic approach to randomness

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Generic oracles and oracle classes

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

Circuit minimization problem

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Derandomizing Arthur-Merlin Games Using Hitting Sets

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Simple extractors for all min-entropies and a new pseudorandom generator

Journal of the ACM (JACM)
Derandomizing polynomial identity tests means proving circuit lower bounds

Computational Complexity
NL-printable sets and nondeterministic Kolmogorov complexity

Theoretical Computer Science - Logic, language, information and computation
Derandomizing Arthur-Merlin games using hitting sets

Computational Complexity
Nearly bounded error probabilistic sets

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Uniform derandomization from pathetic lower bounds

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Dimension characterizations of complexity classes

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On promise problems: a survey

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We demonstrate how to use Lautemann's proof that BPP is in Σ2p to exhibit that BPP is in RPPromiseRP. Immediate consequences show that if PromiseRP is easy or if there exist quick hitting set generators then P = BPP. Our proof vastly simplifies the proofs of the later result due to Andreev, Clementi and Rolim and Andreev, Clementi, Rolim and Trevisan. Clementi, Rolim and Trevisan question whether the promise is necessary for the above results, i.e., whether BPP ⊆ RPRP for instance. We give a relativized world where P = RP ≠ BPP and thus the promise is indeed needed.