NPC Defn

1) LEND ie verifiable in
poly time

L' =p
'

2) L K L c- NPC
(Le NP-hard )
Ince

A- B
suppose =p
'

K L c- NPC
if AENPC
'

L =p
A
=p B
:B c- NPC

if BEP AEP

NPC Problems
solving

1) show that LENP

Provide a certificate ( Proof or
thing that

satisfies )
•

• Provide a verification procedure

Prove the above is
poly time
• -

2) Show LENP Hard -

via reduction L'

=p 2

)
'
(
usually given L

givens ( prob )
• state of known NPC

Étui ( transformation unknown NPC prob)

•
to

•
prod : Sdn in unknown < Sola in known

Using the unknown solver

 e-THamiltouiancyde.tl/t-M-ye:giuenG-(V
vertices exists
, E)
.
,
a
simple cycle through all

111¥ : -
,
a simple path -

Simple -

Cannot repeat vertices

*
Assume that HAM Path is -

NPC (problem States

)
Now
prove 4AM cycle e- NPC
-

1) HAM Cycle -

C- NP

certificate: the
cycle Vo -24 → .vn -78
•
. .

verificationp-oc.edu#: °")

1) check vertices occur exactly once (start = en d)

valid
OCD
2) Check edges are

2) HAM CYCLE -

c- NP-Hard via team -

Path ←
p
HAM -

Cycle

given GCV E) , and instance of HAM -

Path .

o§§§
construct ¥"" "

44007 V' =vu{X}

* 1--04=-1 E' =
EU { Cx> v7 ,
(vix) trev }

Prove
(G) c- HAM -

path < ⇐> c- HAM -

Cycle
4
G- is an instance of HAM Path -
 ham
Suppose vo→u , -7 . - -
→
Y is -

path in G

Gi
V. V →
.→vn→ ✗ v.
is a HAM
Cycle in
-

→ →
, . .

'

is HAM G
suppose cycle
-3 → → X in
⇐ v.
→u
,
-
- -

un
-
>
vo
-

then Vo -
>
V. → .
- -
→
4 is a HAM -
Path in ↳

comhinatorialF-que.de#hecking---D
4) CEI given bool formulas AGE , ,
. .

.pe, ) and

Blx , ,
.
. -

san ) does Fx ,x,

sat .
AFB
,
. .

,
.

a-
Gcvy)^CI~y) LA
=

B=yx , B) ¢ CEC

A-
y
-

(E) Formula SAT book formula Fla gxn )

given , , . . -

does 7.x
, , -
. .

,
✗ ns.t.f-l

1) CEC c- NP

the
certificate :
assignment x
, , . . -

pen

Verificcctionproedure
•
Check Aloe ,
,
. . .

,xn ) f- BGC .
,
. . .

>
"
)
n

OCIAITIBD
2) CEC c- NP-Hard vice Formula -

SAT
=p CEC

boot formula
given some F- Go . , . . .

>
xn )

Aly

.gg#--FCy.s. ,yn)BCy.,- -gym,f- 0Prove-

construct , ,
. -

(F) c- Formula SAT -

<
(A) B) c- CEC

Suppose I x
. ,
. . .

,xn 5. f. F- Cx .
,
. . .

> xn ) =/

then Acx , , . . .
,xn)=l & Bcx . ,Xn)=o
,
. . .

% AFB

s.t.tt/a.s-..,xn)--B(x,,...,xn)F(Ko---gxn)--O--7f--
⇐
Suppose I x
, , -
. -

in