Scribd
Upload
29 views

Paoo F :, Vcohee Y, Is

This document discusses Cook's theorem which states that the satisfiability problem is NP-complete. It presents the theorem using the following assumptions: 1. A non-deterministic Turing machine NT is given to check membership in NP. 2. Boolean variables are used to represent the possible configurations of each cell in NT at each time step. 3. A formula is constructed that is satisfiable if and only if the input is accepted by NT. As the formula can be constructed in polynomial time, this shows that satisfiability is NP-complete.

Uploaded by

Vaibhav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views

Paoo F :, Vcohee Y, Is

This document discusses Cook's theorem which states that the satisfiability problem is NP-complete. It presents the theorem using the following assumptions: 1. A non-deterministic Turing machine NT is given to check membership in NP. 2. Boolean variables are used to represent the possible configurations of each cell in NT at each time step. 3. A formula is constructed that is satisfiable if and only if the input is accepted by NT. As the formula can be constructed in polynomial time, this shows that satisfiability is NP-complete.

Uploaded by

Vaibhav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

THEORy OF ComPoTAT1 ON

CASE STudy-2
NAs: NIRBHAy JAIN
Rou- No > o09 So311
BRACH T11 (M) 2 Yeor

Cook's THEOR EM

Theorem Satisfabili hy is NP- complee.


*
onauogeLis soied to ba NP- Conplet it LENP
onod
for ny
AENe, A L
Paoo F>
Let A be a
org ueze from NP. Then teeis
time Non
deterni nishc Turig Machire NT Porerid
tor ev inbu tor NT we bidd
foT mula
encooi rg th
afroposikionol
Combutatior NTC such tht
6ofst assignments bo
paths in NT() comspo rd exact to
If , ts shor enouh md Con be
Constoucted
Poyonid m
we
pet th
in

Teeucfon. reajuired poly omial ine


ssumptos obou NT
Ass Ass un that NT
Us
htl
h+ Smbols
, we o,
K+ sots s blonk mbol)
,VCohee y, is ymbol)
instTuctiorg Y, Y o.cca i Ctato)
-is hinet boos;t taomsios
dstn boosibk tronsios
Ass u tht bdh NT(x) ks
evey in
Aong th lal
Assume that the tope heod neve moves to tha the
trom the 4tmost symbolofthe ínput.
Variabs
We boolean Vwiabls to sheuly eractly th þossi bla
use

Con' wokions of t nacure o eack time tét= 1«1:


i s tu if ond only if s-th cell Cortoirs mbod
O o time t.
(the oe Ch). Ja. lxof tkm)
is te iff NT shte y. aot time
in
thou K t 1 ) . I»y of tem)

Sstss true if tobe keaol on s-tk cellotnet


Ctheree l*. l of
them).
R is true tff mocin
inpkmats instauction
tine t.
thexe o
f. oF them)
foRmoLA 2
No,we
No we
thtormile
write

A 8aC DEafa aaH J K


A A ss each
cella eock time contains
ON mbod. 2xact
2xactly

A (vti v-v)A
CRemem ber that (x5 Y)z (Gxv Y))
AsAsi A Ps,A.-A Ast
A A, A A A
Ctho (Ch*)h +1). Ix1. Ix1 clause in
A)
8 sos a lood e vact
tao sans o ull ath kime
B(Se vS,V..v Se,t) a
An
8
Gi>-S,E)
C
Says thotNT sin exact on sbte
6 th
N inph nonk ezacty On intruckon of 2ach

s thtot Hne t h input x s on th fistn


cells of tt tope, the haad i
a positon 1,nd he
stat is .

then
S

P
naig t*
Jeti f,4,H od I s
foloos foT eoh
tor eoth instru
instru eton
cton

FF ss
5os that Y is avid trosikon
A
1S,bst ( )> (9;a Pi,)
eAji vory in CNF

A
ss tet* sVRva) AlsvRVR)
sAiias t efec on th gtote

Hsp dfiu th t Coe mbod is Ctten


(R Sg, ) -> ,tn
sbsúfes tht the Coye mwvemept is nade
CP AS, c) Ss+d (m, t*i
hore d(U) : -1
, dte) - i, dCS)
Finally, k
sys that the
accep tin stode , is esteod
K v a v.. v 9
Conelu sion:>
Com orst yuut formula b. in
poly no i l time,
Mote h t th
unstruekon is
ony possib in pinuipu
Sine th a Loi yot e ecess ariy kwwn)
T
toTmule i s
Vaiabk
sdisfiosle hen te voluu of f
skesl acej ting on
compubtion tor .

COnver, # Hoa is nccopting Computae n for x, the,


on

CorCorieporoir oluy of he vaable


th fos mula will sakit
d
Hena, xEL , e Lakistabiley
ED

You might also like