P vs NP

. ,

.
, 1956
.
NP (
)
.[2]
P vs NP 1971

[3]
.[4]
(Millennium Prize)
(Clay Mathematics Institute) 1
.
, ,
.

" P" "P".
,

, .
""
NP.
,
, ,,
. ,
0; ,
{2, 3, 15, 14, 7, 10} 0;
", {2, 3, 10, 15} 0"
. ,
(
, , , 2n-n-1
), P = NP.
NP ( ) P (
).
P = NP
,
, .
P NP, NP ( NP-
)
.
.
,
, ,
, , ,
, .

 []

2 P = NP;

3NP

5NP P NP-

6P "";

7 P NP

o 8.1P = NP

10

11

12

13

o 13.1P NP

13.1.1

14

15

16

[ | ]
P NP
,
.
(
) (
).
,
. ,
(
 ,
) (
).
, P

.
NP

, ,
- .[5] , P NP.

:

P = NP;[ | ]
2002, 100 , 61
, 9 , 22
. 8
. [6]
2012, 10 , .
151: 126 (83%)
, 12 (9%) , 5 (3%)

, 8 (5%)

.[7]

NP [ | ]

Euler P, NP, NP- NP- .

P = NP
NP-. NP-
NP-
,
. NP
NP- .
, NP- NP
"" NP.
NP-
NP , , NP
( ) . NP-
 NP, ,
.
,
NP- CookLevin,
NP

.
NP- .
NP- P, P = NP. ,
NP-,
.
NP-
. NP-
: Turing M
,
; [8] NP (
) ,
M. NP-
NP
,
. " "
, .
NP-
.
, CookLevin.
NP-
Turing, NP. ,
NP-,

NP-,
. ,
,
" ".

[ | ]
P = NP, P .
(
, )
EXPTIME-.
P EXPTIME, P,
. ,
,
.
( N N )[9] .[10]

Presburger . Fischer Rabin
1974
Presburger "" c. , n
 Presburger. ,
.
, .
,

.
, ,
' .

NP
P NP-[ | ]
: NP-intermediate
Ladner P NP
NP P NP-.[1]
NP-.
,

NP-. NP
P NP-.
The
.

P, NP- NP-.

NP-.[11] NP-,
. [12]
[13]


NP-.
, Laszlo Babai Eugene Luks
2O(nlog(n)) n .

.
,
k.

,
RSA. NP co-NP[14]).
NP-,
.
t ,
n' .

P "";
[ | ]
 ( 100 ms
933 MHz Pentium III)

state-of-the-art.
50-10.000
O((log(n))2).[15]

P "" " P" "",
Cobham.
. ,
.
, .

.
, NP-,
P NP,
.
NP- , ,

,

. (
)
.
simplex ,
.
,
.[16]
,
Turing P NP ,
.

P
NP[ | ]
,[6][17]
P NP. -""
,

3000 NP- ( NP-
).
NP- ( 21 NP-
Karp, ,
NP-). ,
P = NP
, NP = co-
NP P = PH.
,
,
, . [18]
P = NP,
.
" ",
.
Scott Aaronson, MIT
,
P NP
P = NP. , 2002
:[6]
P NP
. ,
, .
. [...]
Fermat

.
Moshe Y. Vardi, Rice University

.
.
,
,
.
Anil Nerode, Cornell University

[ | ]

.
,
.
P = NP[ | ]
P = NP
,

'NP' .
, ,

. ,
, 'NP' -
.
, ,
.

.
.

[ | ]
P = NP?

,
. ,

P = NP
,

.


,
P NP:

Turing,

.
( )

.
. 1975
Baker, Gill Solovay P = NP
, P NP
.[17]

,

P = NP.
 1993, Alexander Razborov Steven
Rudich


.

.



P = NP. ' Razborov Rudich
,

P NP.
,
,


P NP.

P = NP.

Baker-Gill-Solovay, -

IP = PSPACE.
' , 2008, Scott Aaronson Avi
Wigderson
IP = PSPACE,
,
P = NP.[18]

NP-
:
NP- ,
P = NP
.

P NP

ZFC ( ).

NP-
,
(..) ZFC, NP-
,
ZFC . [19] '
, ,
,
()
 ,
- NP.[20] ,
(
)
NP ,
.
,
ZFC

NP.

ZFC

,
, ZFC.
P = NP .[21]

[ | ]
P NP ,[22]

. Woeginger
.[23] 2010
P NP, Vinay Deolalikar, HP
Labs, Palo Alto,
"
" .[24]
,[25][26] Neil Immerman,
, .
[27]
2010, Deolalikar
.[28] '



.[29] 2013
The New Yorker
" ."[30]

[ |
]
P = NP
,
.

, . ,
P

(fixed-point combinator).
, NP
, ,

, .
'PH' ,
. , " 'P'
'NP'
(
)
; .,[31] .

[ | ]
NP-
. , NP-
P = NP,
( ,
). , Leonid
Levin, . NP-
SUBSET-SUM.
P = NP:

// 'NP- SUBSET-
SUM.
//
//
P = NP.
//
// " " ""

// "",
"".
//
// : S =
// : "" S
0.
// .
// : " P"

// P ,
// bits .
//
// ,
// .
N = 1...
P = 1...N
P N
S

S
0

""

, , P = NP,
NP- . ""
"" ,
""(
-).
, P = NP.
SUBSET-SUM
.

[ |
]
P NP[ | ]

w , "" "".
( ,

n
cnk , k c
,
P. , P


. ,



:

1. M w

2. , O
Big O :
 NP
(
). ,
NP
. , NP

,
.
L , .
L NP , ,
k
:

1. (x, y) R

2. Turing
.
Turing LR
L y t (x, y) R
x L.
,
. , L NP,

.
[ | ]

, x ,
x
COMPOSITE.
COMPOSITE NP
(
).
COMPOSITE P.[46][47]
NP-
NP-
.
L .
L NP- , ,
:

1. L NP;

2. L \in NP -
L ( ),
, :
 1. f : * * w *
: ;

2.
f(w)
w.

[ |
]
1. , :1,0 1,1