Related papers: The P versus NP Problem
This paper has been removed by arXiv administrators because it plagiarizes gr-qc/9910015, gr-qc/0008034, and hep-th/0308070. This paper also has excessive overlap with the following papers also written by the authors or their collaborators:…
This paper demonstrates that P \not= NP. The way was to generalize the traditional definitions of the classes P and NP, to construct an artificial problem (a generalization to SAT: The XG-SAT, much more difficult than the former) and then…
The question of whether all problems in NP class are also in P class is generally considered one of the most important open questions in mathematics and theoretical computer science as it has far-reaching consequences to other problems in…
This article has been withdrawn
This paper has been withdrawn by the author due to the presented idea is wrong.
This paper has been removed by arXiv administrators because it plagiarizes gr-qc/0011027, "Viscous cosmologies in scalar-tensor theories for Kasner type metrics," by M. Cataldo, S. del Campo and P. Salgado; gr-qc/0301022, "A generalisation…
This paper has been withdrawn by the author due to an extended and largely modified version of the paper was published in arXiv (see arXiv:0807.3694, Disjoint minimal graphs).
This article has been removed by arXiv administrators due to falsified authorship.
By creating some new concepts and methods: checking tree, long unit path, direct contradiction unit pair, indirect contradiction unit pair, additional contradiction unit pair, 2-unit layer and 3-unit layer, redundant units, and destroying…
We give a reduction from {\sc clique} to establish that sparse PCA is NP-hard. The reduction has a gap which we use to exclude an FPTAS for sparse PCA (unless P=NP). Under weaker complexity assumptions, we also exclude polynomial…
This paper has been removed by arXiv administrators because it plagiarizes gr-qc/0203084, gr-qc/0607138, gr-qc/0011087, gr-qc/0102070, gr-qc/0607138, gr-qc/0109017, gr-qc/0212018, and gr-qc/9409039.
Complexity theory as practiced by physicists and computational complexity theory as practiced by computer scientists both characterize how difficult it is to solve complex problems. Here it is shown that the parameters of a specific model…
This paper has been withdrawn by the authors due to a crucial error in the proof of the main result. In a new manuscript (with two new authors) available at arXiv:1010.2791v1 this problem has been resolved.
In this paper we study the long-standing open question regarding the computational complexity of one of the core problems in supply chains management, the periodic joint replenishment problem. This problem has received a lot of attention…
This paper was withdrawn by arXiv administrators. It is an erroneous duplicate submission of math.NA/0405095.
This article finds the answer to the question: for any problem from which a non-deterministic algorithm can be derived which verifies whether an answer is correct or not in polynomial time (complexity class NP), is it possible to create an…
The number partition problem is a well-known problem, which is one of 21 Karp's NP-complete problems \cite{karp}. The partition function is a boolean function that is equivalent to the number partition problem with number range restricted.…
This paper has been withdrawn by the author because overcame by arXiv:0910.4694
This article has been replaced by arXiv:0807.3093
This paper is withdrawn since there is a problem in the previous paper on which it is based.