BPP is in NP and coNP
Computational Complexity
2011-02-25 v2
Abstract
We show that the class BPP is in NP and coNP. This paper has been withdrawn by the author because B and B' are probabilistic and nonequalities 10 cannot be checked in polynomial time.
Cite
@article{arxiv.1102.4346,
title = {BPP is in NP and coNP},
author = {Rooholah Majdodin},
journal= {arXiv preprint arXiv:1102.4346},
year = {2011}
}
Comments
This paper has been withdrawn