Related papers: The P versus NP Problem

In order to prove that the P of problems is different to the NP class, we consider the satisfability problem of propositional calculus formulae, which is an NP-complete problem. It is shown that, for every search algorithm A, there is a set…

A short proof of the classic Hardy inequality is presented for $p$-norms with $p>1$. Along the lines of this proof a sharpened version is proved of a recent generalization of Hardy's inequality in the terminology of probability theory. A…

We introduce a new decision problem, called Packed Interval Covering (PIC) and show that it is NP-complete.

Withdrawn by arXiv administrators due to content entirely plagiarized from other authors (not in arXiv).

It is shown that graph-theoretic problem CLIQUE can't be solved in polynomial time by any deterministic TM. This upgrades the well-known partial result that claims only monotone unsolvability thereof, and eventually implies P $\neq$ NP as…

We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.

This paper has been removed by arXiv administrators because it plagiarizes hep-th/0308070, gr-qc/9910015, and others. This paper has excessive overlap with the following papers also written by the authors or their collaborators:…

I describe three geometric approaches to resolving variants of P v. NP, present several results that illustrate the role of group actions in complexity theory, and make a first step towards completely geometric definitions of complexity…

Admin note: withdrawn by arXiv admin because of the use of a pseudonym, in violation of arXiv policy.

This paper has been removed by arXiv administrators because it plagiarizes gr-qc/0404032 and others.

Withdrawn by arXiv administration because authors have forged affiliations and acknowledgements, and have not adequately responded to charges [hep-th/9912039] of unattributed use of verbatim material.

An arXiv administrator withdrew this article because it is a duplicate of math/0608203.

This paper has been withdrawn by the author due to text overlap with arXiv:1102.5004, as well as omission of proper citations to arXiv:1110.4655 and arXiv:1111.0313

This paper has been withdrawn by arXiv administrators because of disputed claims of authorship among former collaborators

This paper has been withdrawn by the author. The most updated version can be accessed by arXiv:1806.07290.

This paper has been withdrawn by the author due to a misunderstanding about 3QBF.

We present an approximation notion for NP-hard optimization problems represented by binary functions. We prove that (assuming P != NP) the new notion is strictly stronger than FPTAS, but strictly weaker than having a polynomial-time…

This paper has been withdrawn because there is a fundamental error in the computations; with the right computational scheme it seems to be just a version of the Jones polynomial

Given a sequence of $N$ positive real numbers $\{a_1,a_2,..., a_N \}$, the number partitioning problem consists of partitioning them into two sets such that the absolute value of the difference of the sums of $a_j$ over the two sets is…

The notion of nondeterminism has disappeared from the current definition of NP, which has led to ambiguities in understanding NP, and caused fundamental difficulties in studying the relation P versus NP. In this paper, we question the…