Related papers: The P versus NP Problem
This article has been withdrawn by arXiv administrators because it plagiarises http://www2.ece.ohio-state.edu/~ekici/papers/crnroutingsurvey.pdf
We examine a proof by Craig Alan Feinstein that P is not equal to NP. We present counterexamples to claims made in his paper and expose a flaw in the methodology he uses to make his assertions. The fault in his argument is the incorrect use…
This paper has been withdrawn by the author. This paper is now obsolete. For a solution please see: arXiv:/1205.4265.
A dichotomy theorem for counting problems due to Creignou and Hermann states that or any nite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for…
The derandomization of MA, the probabilistic version of NP, is a long standing open question. In this work, we connect this problem to a variant of another major problem: the quantum PCP conjecture. Our connection goes through the…
This paper has been withdrawn because it is superseded by quant-ph/9905084 "Bayesian analysis of Bell inequalities.
We study the problem of anonymizing tables containing personal information before releasing them for public use. One of the formulations considered in this context is the $k$-anonymization problem: given a table, suppress a minimum number…
This paper presents an analytic solution of the incompressible Navier-Stokes equations as recurrence relations for the solution's derivatives, addressing the Clay Mathematics Institute's Millennium Prize problem on Navier-Stokes existence…
The content of the comment [hep-th/9712219] is the derivation of Eq.(13) in Phys. Rev. Lett. 78 (1997) 163 by direct differential calculus: which is precisely the same method we used to derive it (it is in fact difficult to imagine any…
The Possible-Winner problem asks, given an election where the voters' preferences over the set of candidates is partially specified, whether a distinguished candidate can become a winner. In this work, we consider the computational…
This paper has been removed by arXiv administrators because it plagiarizes P.K. Jena, P.C. Naik and T. Pradhan, "Photon As The Zero Mass Limit Of Dkp Field," J. Phys. A {\bf 13}, 2975 (1980) [not cited within submission]. In addition, the…
Reducing the NP-problems to the convex/linear analysis on the Birkhoff polytope.
In this paper we propose a new approach for developing a proof that P=NP. We propose to use a polynomial-time reduction of a NP-complete problem to Linear Programming. Earlier such attempts used polynomial-time transformation which is a…
Conjunctive query (CQ) evaluation is NP-complete, but becomes tractable for fragments of bounded hypertreewidth. Approximating a hard CQ by a query from such a fragment can thus allow for an efficient approximate evaluation. While…
In an attempt to provide an answer to the increasing criticism against p-values and to bridge the gap between statistical inference and prediction modelling, we introduce the probability of improved prediction (PIP). In general, the PIP is…
This submission has been withdrawn by arXiv admins because it contains inappropriate overlap with arXiv:physics/0603087.
This document presents a simpler proof showcasing the NP-hardness of Familial Graph Compression.
This paper presents a new representation of natural numbers and discusses its consequences for computability and computational complexity. The paper argues that the introduction of the first Peano axiom in the traditional definition of…
A comprehensive review on Cook's contribution in the theory of NP-Completeness with relations to modern mathematics.
The resolution of the P vs. NP problem, a cornerstone in computational theory, remains elusive despite extensive exploration through mathematical logic and algorithmic theory. This paper takes a novel approach by integrating information…