Related papers: The P versus NP Problem
Stephen Cook posited SAT is NP-Complete in 1971. If SAT is NP-Complete then, as is generally accepted, any polynomial solution of it must also present a polynomial solution of all NP decision problems. It is here argued, however, that NP is…
This paper has been withdrawn by the author due to a crucial error in eq.59. I apologize for the inconveniences.
This paper was withdrawn by arXiv admin because it plagiarizes "Jiahong Wu The two-dimensional quasi-geostrophic equation with critical or supercritical dissipation 2005 Nonlinearity 18 139-154."
The P=?NP problem is philosophically solved by showing P is equal to NP in the random access with unit multiply (MRAM) model. It is shown that the MRAM model empirically best models computation hardness. The P=?NP problem is shown to be a…
The CMI Millennium "P vs NP Problem" can be resolved e.g. if one shows at least one counterexample to the conjecture "P is equal to NP". A certain class of problems being such counterexamples is formulated. This implies the rejection of the…
Withdrawn by arXiv administration because the text and equations were plagiarized from chapter 10 of the BaBar Physics Book http://www.slac.stanford.edu/pubs/slacreports/slac-r-504.html See also hep-ph/0304045
This paper was removed by arXiv admin because it plagiarizes "Ding, Yong(PRC-BJN); Fan, Dashan(PRC-ANH); Pan, Yibiao(1-PITT) Weighted boundedness for a class of rough Marcinkiewicz integrals. Indiana Univ. Math. J. 48 (1999), no. 3,…
This paper was removed by arXiv admin because it plagiarizes "Ding, Yong(PRC-BJN); Fan, Dashan(PRC-ANH); Pan, Yibiao(1-PITT) Weighted boundedness for a class of rough Marcinkiewicz integrals. Indiana Univ. Math. J. 48 (1999), no. 3,…
This submission has been withdrawn at the request of the author.
This article has been withdrawn by arXiv administrators because it plagiarises arXiv:1006.4556 (published in Phys. Lett. B 693, 129 (2010)).
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
We survey a collective achievement of a group of researchers: the PCP Theorems. They give new definitions of the class \np, and imply that computing approximate solutions to many \np-hard problems is itself \np-hard. Techniques developed to…
We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…
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 13, 2975 (1980) [not cited within submission]. In addition, the…
In this paper we discusses the relationship between the known classes P and NP. We show that the difficulties in solving problem "P versus NP" have methodological in nature. An algorithm for solving any problem is sensitive to even small…
Motivated by the fact that information is encoded and processed by physical systems, the P versus NP problem is examined in terms of physical processes. In particular, we consider P as a class of deterministic, and NP as nondeterministic,…
This paper has been withdrawn Abstract: This paper has been withdrawn by the author due to the publication.
This article presents counter examples for three articles claiming that P=NP. Articles for which it applies are: Moustapha Diaby "P = NP: Linear programming formulation of the traveling salesman problem" and "Equality of complexity classes…
This paper has been removed by arXiv administrators because it plagiarizes gr-qc/9803014, "A White Hole Model of the Big Bang," by Philip Gibbs.
The relationship between the complexity classes P and NP is an unsolved question in the field of theoretical computer science. In this paper, we look at the link between the P - NP question and the "Deterministic" versus "Non Deterministic"…