Related papers: BPP is in NP and coNP
This paper has been withdrawn by the author(s) in the light of several other works available and due to a misunderstanding in the authorships.
This paper has been withdrawn because it is superseded by quant-ph/9905084 "Bayesian analysis of Bell inequalities.
This paper has been withdrawn by the author, due to possible counter-examples.
Withdrawn due to extensions and submission as another paper.
The paper proposes a logical model of combinatorial problems, also it gives an example of a problem of the class NP that can not be solved in polynomial time on the dimension of the problem.
We review Andr\'e Luiz Barbosa's paper "P != NP Proof," in which the classes P and NP are generalized and claimed to be proven separate. We highlight inherent ambiguities in Barbosa's definitions, and show that attempts to resolve this…
In this paper we discusses the relationship between the known classes P and NP. We show that the difficulties in solving problem "P versus NP" have methodological in nature. An algorithm for solving any problem is sensitive to even small…
This paper has been withdrawn by the author due to text overlap with arXiv:1102.5004, as well as omission of proper citations to arXiv:1110.4655 and arXiv:1111.0313
This paper has been withdrawn by the author; see the much expanded, improved, and generalized version at arXiv:0811.2080.
We survey recent developments in the study of probabilistic complexity classes. While the evidence seems to support the conjecture that probabilism can be deterministically simulated with relatively low overhead, i.e., that $P=BPP$, it also…
This paper has been withdrawn by the author due to a misunderstanding about 3QBF.
This paper has been withdraw by the auhor due to a mistake in classification of the algebra
This paper has been withdrawn by the author due to a gap in the proof of Lemma 3.4
This paper has been withdrawn by the authors, due a gap in the proof of the main Theorem.
We show that BPP has either SUBEXP-dimension zero (randomness is easy) or BPP=EXP (randomness is intractable).
This paper is withdrawn because the results in the paper are included in a paper to be published in Mathematical and Computer Modelling.
The paper is being withdrawn. A new submission will follow.
This paper considers the question of P = NP in context of the polynomial time SAT algorithm. It posits proposition dependent on existence of conjectured problem that even where the algorithm is shown to solve SAT in polynomial time it…
This paper has been withdrawn by the author, due an error in the proof of Proposion 2.13.
This paper has been withdrawn by the author, since the author does not have enough time to answer every questions on this result.