Related papers: The P versus NP Problem
This paper has been removed by arXiv administrators because it plagiarizes gr-qc/0212018, gr-qc/0501002, and gr-qc/9601044. This paper has excessive overlap with the following papers also written by the authors or their collaborators:…
This paper demonstrates the relativity of Computability and Nondeterministic; the nondeterministic is just Turing's undecidable Decision rather than the Nondeterministic Polynomial time. Based on analysis about TM, UM, DTM, NTM, Turing…
Recently a large number of graph separator problems have been proven to be \textsc{NP-Hard}. Amazingly we have found that $\alpha$-Subgraph-Balanced-Vertex-Separator, an important variant, has been overlooked. In this work ``Yet Another…
Theoretical complexity is a vital subfield of computer science that enables us to mathematically investigate computation and answer many interesting queries about the nature of computational problems. It provides theoretical tools to assess…
In this article, I focus on the resiliency of the P=?NP problem. The main point to deal with is the change of the underlying logic from first to second-order logic. In this manner, after developing the initial steps of this change, I can…
This results in this paper have been merged with the result in arXiv:1003.0167. The authors would like to withdraw this version. Please see arXiv:1008.5356 for the merged version.
This paper has been withdrawn by the author(s), due to the existence of a much better paper in http://arxiv.org/abs/cs.CR/0207027
The paper is withdrawn by the authors and replaced be an improved and extended version arxiv: 0812.2968
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…
We introduce the idea that the P vs NP problem can have a finer structure. Given the NP complete problem of interest, the configurations space of the problem can be divided in (at least) two regions. In one region, polynomial algorithms to…
In this critique, we examine the technical report by Daniel Uribe entitled "P vs. NP." The paper claims to show an exponential lower bound on the runtime of algorithms that decide CLIQUE. We show that the paper's proofs fail to generalize…
We state a version of the P=?NP problem for infinite time Turing machines. It is observed that P not= NP for this version.
This paper has been removed by arXiv administrators because it plagiarizes astro-ph/0611537, astro-ph/0506256, astro-ph/0203033, astro-ph/0311128, gr-qc/0505144, astro-ph/0611460, and astro-ph/0610840.
The paper is concerned with the IBVP of the Navier-Stokes equations. The goal is the attempt to construct a weak solution enjoying an energy equality. This result is a natural continuation and improvement of the one obtained by the same…
IV-matching is a generalization of perfect bipartite matching. The complexity of finding IV-matching in a graph was posted as an open problem at the ICALP 2014 conference. In this note, we resolve the question and prove that, contrary to…
A decade ago, a beautiful paper by Wagner developed a ``toolkit'' that in certain cases allows one to prove problems hard for parallel access to NP. However, the problems his toolkit applies to most directly are not overly natural. During…
A central question in computer science and statistics is whether efficient algorithms can achieve the information-theoretic limits of statistical problems. Many computational-statistical tradeoffs have been shown under average-case…
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input permutations is fixed and show that the problem is NP-hard for…
The purpose of this article is to examine and limit the conditions in which the P complexity class could be equivalent to the NP complexity class. Proof is provided by demonstrating that as the number of clauses in a NP-complete problem…
This paper was removed by arXiv admin because it plagiarizes the electronic article HYKE 2005-010 (http://www.hyke.org/preprint/index.php), by Jose-A. Carrillo and Lucas C.f. Ferreira, entitled "Self-similar solutions and large time…