Related papers: BPP is in NP and coNP
This paper has been withdrawn by the author since the proof of Lemma 8 is not correct.
This paper has been withdrawn. It was an early draft submitted prematurely in error. A complete version is to be submitted shortly.
The paper has been withdrawn by the authors. The contents of the paper will be used in a future communication which will contain major addition and shift of focus.
This paper has been withdrawn by the authors due to a possible inconsistency in the program code.
This paper has been withdrawn by the author, due to an error in the inequality after the inequality (31).
This paper has been withdrawn. A significantly revised version will be posted in the near future.
The paper is withdrawn due to an error in Section 2.
This paper has been withdrawn by the author because overcame by arXiv:0910.4694
This paper has been withdrawn by the authors due to a more research needed to estimate $h^{*}_{n}(b)$ which really should be written as $h^{*}_{n}(b,A)$ for $b\in \Gamma (t)$.
Strong bisimilarity on normed BPA is polynomial-time decidable, while weak bisimilarity on totally normed BPA is NP-hard. It is natural to ask where the computational complexity of branching bisimilarity on totally normed BPA lies. This…
A long standing open problem in the computational complexity theory is to separate NE from BPP, which is a subclass of $NP_T(NP\cap P/poly)$. In this paper, we show that $NE\not\subseteq NP_(NP \cap$ Nonexponentially-Dense-Class), where…
This paper has been withdrawn by the authors due to the crucial wrong assumption following Eq. 9.
We show that the problem of determining the feasibility of quadratic systems over $\mathbb{C}$, $\mathbb{R}$, and $\mathbb{Z}$ requires exponential time. This separates P and NP over these fields/rings in the BCSS model of computation.
This paper has been withdrawn by the author, due a crucial error in the optimization. For the last one month I have been trying to remove the error, but it seems to take a lot of time so I decided to withdraw this paper for the moment.
This paper has been withdrawn since the results are not satisfied.
The paper has been withdrawn by the author due to a crucial error.
This paper has been withdrawn, because it is subsumed by the new preprint arXiv:0806.4540 .
This paper has been withdrawn. The authors realized that the obtained results were not new.
Schindler recently addressed two versions of the question P $\stackrel{?}{=}$ NP for Turing machines running in transfinite ordinal time. These versions differ in their definition of input length. The corresponding complexity classes are…
This paper has been withdrawn by the author due to a crucial error in the submission action.