A class of examples demonstrating that P is different from NP in the "P vs NP" problem

by   Vasil Penchev, et al.

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 hypothesis "P is equal to NP" for any conditions satisfying the formulation of the problem. Thus, the solution "P is different from NP" of the problem is proved. The class of counterexamples can be interpreted as any quantum superposition of any finite set of quantum states. The Kochen-Specker theorem is involved. Any fundamentally random choice among a finite set of alternatives belong to NP, but not to P. The conjecture that the set complement of P to NP can be described by that kind of choice is formulated exhaustively.



There are no comments yet.


page 1

page 2

page 3

page 4


Quantified X3SAT: P = NP = PSPACE

This paper shows that P = NP via one-in-three (or exactly-1) 3SAT, and t...

Philosophical Solution to P=?NP: P is Equal to NP

The P=?NP problem is philosophically solved by showing P is equal to NP ...

Separation of P and NP

There have been many attempts to solve the P versus NP problem. However,...

Stoquastic PCP vs. Randomness

The derandomization of MA, the probabilistic version of NP, is a long st...

Overarching Computation Model (OCM)

Existing models of computation, such as a Turing machine (hereafter, TM)...

Nondeterminisic Sublinear Time Has Measure 0 in P

The measure hypothesis is a quantitative strengthening of the P != NP co...

On W[1]-Hardness as Evidence for Intractability

The central conjecture of parameterized complexity states that FPT is no...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.