Title :
A zero one law for RP
Author :
Impagliazzo, Russell ; Moser, Philippe
Author_Institution :
Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA
Abstract :
We show that if RP has p-measure nonzero then ZPP=EXP. As corollaries, we obtain a zero-one law for RP, and that both probabilistic classes ZPP and RP have the same p-measure. Finally we prove that if NP has p-measure nonzero then NP=AM.
Keywords :
Boolean functions; Turing machines; circuit complexity; computability; probabilistic automata; AM probabilistic class; NP class; RP probabilistic class; ZPP probabilistic class; circuit complexity; computable Boolean function; p-measure nonzero; probabilistic Turing machine; zero one law; Boolean functions; Complexity theory; Computer errors; Computer science; Size measurement; Turing machines;
Conference_Titel :
Computational Complexity, 2003. Proceedings. 18th IEEE Annual Conference on
Print_ISBN :
0-7695-1879-6
DOI :
10.1109/CCC.2003.1214409
