TL;DR
This paper claims that BPP, a class of probabilistic polynomial-time problems, is contained within NP and coNP, but the author withdrew it due to issues with probabilistic verification.
Contribution
It attempts to establish that BPP is in NP and coNP, suggesting a potential collapse of complexity classes.
Findings
Claimed BPP is in NP and coNP
Author withdrew the paper due to verification issues
Probabilistic inequalities cannot be checked in polynomial time
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAuction Theory and Applications · Supply Chain and Inventory Management