Related papers: The P versus NP Problem
This paper has been removed by arXiv administrators because it plagiarizes hep-th/0307162, gr-qc/9601044, gr-qc/0510040, gr-qc/0205028, gr-qc/0212018, and gr-qc/0605145.
We introduce the {\it Bipartite Multi-cut} problem. This is a generalization of the {\it st-Min-cut} problem, is similar to the {\it Multi-cut} problem (except for more stringent requirements) and also turns out to be an immediate…
After presentations of Raz and Tal's oracle separation of BQP and PH result, several people (e.g. Ryan O'Donnell, James Lee, Avishay Tal) suggested that the proof may be simplified by stochastic calculus. In this short note, we describe…
This paper is a critique of version three of Joonmo Kim's paper entitled "P is not equal to NP by Modus Tollens. [arXiv:1403.4143v3]" After summarizing Kim's proof, we note that the logic that Kim uses is inconsistent, which provides…
Motivated by the theory of proof complexity generators we consider the following $\Sigma^p_2$ search problem $\mbox{DD}_P$ determined by a propositional proof system $P$: given a $P$-proof $\pi$ of a disjunction $\bigvee_i {\alpha}_i$, no…
This paper has been removed by arXiv administrators because it plagiarizes gr-qc/0304081, gr-qc/0212018, gr-qc/0501002, gr-qc/9601044, and gr-qc/0109017. This paper also has excessive overlap with the following papers also written by the…
Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results. We survey developments in the area both from the algorithmic and…
The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown $NP$-hard by expressing the satisfiability of boolean formulas in 3-conjunctive normal form as such an intersection. The corresponding…
The present work proves that P=NP. The proof, presented in this work, is a constructive one: the program of a polynomial time deterministic multi-tape Turing machine M_ExistsAcceptingPath, that determines if there exists an accepting…
When it comes to NP, its natural definition, its wide applicability across scientific disciplines, and its timeless relevance, the writing is on the wall: There can be only one. Quantum NP, on the other hand, is clearly the apple that fell…
This paper has been removed by arXiv administrators because it plagiarizes gr-qc/0301090, gr-qc/0303034, gr-qc/0212018, and gr-qc/9601044.
We show that the problem of finding a Resolution refutation that is at most polynomially longer than a shortest one is NP-hard. In the parlance of proof complexity, Resolution is not automatizable unless P = NP. Indeed, we show it is…
The one-sided P-value has a long history stretching at least as far back as Laplace (1812) but has in recent times been mostly supplanted by the two-sided P-value. We present justification for a bijective relationship between the one-sided…
Calculating the probability of an individual solution being selected under lexicase selection is an important problem in attempts to develop a deeper theoretical understanding of lexicase selection, a state-of-the art parent selection…
We give a more detailed description of the new system of Pl\"ucker-like equations from [4], discuss how it relates to the usual Pl\"ucker equations, and correct a mistake in that article.
Voting theory has become increasingly integrated with computational social choice and multiagent systems. Computational complexity has been extensively used as a shield against manipulation of voting systems, however for several voting…
This submission has been withdrawn by arXiv administrators because of inappropriate authorship claims.
This version has been withdrawn. The new and final version is on ArXiv 1103.4878
This paper has been withdrawn, see the replacement arXiv:1302.6670.
We indicate that an argument of da Costa and Doria in fact proves P=NP. This observation makes their argument appear dubious. We isolate a weak version of one of their lemmas which would already prove P=NP. We point out that even this weak…