Related papers: BPP is in NP and coNP
This paper has been withdrawn by the author because it needs to be rewritten completely.
The paper was withdrawn because of its significant overlap with a paper appeared recently.
This paper is withdrawn because the results in the paper are included in a paper to be published in Mathematical and Computer Modelling.
This paper has been withdrawn, since it contains a corollary with impossible consequences and the source of an error is currently unknown.
Although the results are correct, it was pointed out that the results follow from some previously known results. Accordingly, this version of the paper is withdrawn by the authors.
This paper has been withdrawn by the author due to the presented idea is wrong.
This paper is withdrawn because the results in the paper are included in a paper to be published in Mathematical and Computer Modelling.
We compare the complexity of the search and decision problems for the complexity class S2P. While Cai (2007) showed that the decision problem is contained in ZPP^NP, we show that the search problem is equivalent to TFNP^NP, the class of…
We consider a class of $0$-$1$ polynomial programming termed multiple choice polynomial programming (MCPP) where the constraint requires exact one component per subset of the partition to be $1$ after all the entries are partitioned.…
We study the P versus NP problem through properties of functions and monoids, continuing the work of [3]. Here we consider inverse monoids whose properties and relationships determine whether P is different from NP, or whether injective…
This paper has been withdrawn by the author due to an error.
This paper has been withdraw by the authors. An enlarged and complete analysis of the constraints is presented in hep-th/9910163. It includes also relativistic particles and strings. The non-relativistic particle quantization has been…
We prove that P != NP by proving the existence of a class of functions we call Tau, each of whose members satisfies the conditions of one-way functions. Each member of Tau is a function computable in polynomial time, with negligible…
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the program. In this paper, we classify HPPs into three classes…
This paper has been withdrawn by the author due to the presented idea is wrong.
We show that the problem of deciding membership in the moment polytope associated with a finite-dimensional unitary representation of a compact, connected Lie group is in NP and coNP. This is the first non-trivial result on the…
This paper has been withdrawn by the authors due to a crucial error in the proof of the main result. In a new manuscript (with two new authors) available at arXiv:1010.2791v1 this problem has been resolved.
The class $\mathcal{UP}$ of `ultimate polynomial time' problems over $\mathbb C$ is introduced; it contains the class $\mathcal P$ of polynomial time problems over $\mathbb C$. The $\tau$-Conjecture for polynomials implies that…
The paper is being withdrawn since the authors felt that the submission is a little premature after a careful reading by some of the experts in this field.
This paper has been withdrawn. A much-improved version can be found at hep-ph/0209176.