Professional Documents
Culture Documents
61 NP Complete
61 NP Complete
Mt s bi ton ti u ri rc
2013-11-25
Mt s bi ton ti u ri rc
Bi ton t mu th:
Cho th G ={V,E}.
OP: S mu t nht t th G?
DP: Cho s nguyn K. C tn ti hay khng cch t mu th
G vi s mu khng qu K?
Mt cch t mu th l mt phng n gn cho mi nh mt mu, sao
cho hai nh lin k c hai mu khc nhau.
2013-11-25
Mt s bi ton ti u ri rc
Bi ton ci ti:
Cho n vt vi kch thc l cc s nguyn s1, s2, ..., sn v cc ti
vi kch thc l s nguyn T.
OP: Tm s ti t nht xp cc vt.
DP: Cho s nguyn K. C tn ti cch xp cc vt vo khng qu K
ti vi sc cha T?
2013-11-25
Mt s bi ton ti u ri rc
Bi ton tp con:
Cho s nguyn dng T v tp X gm n s nguyn dng a1, a2, ..., an.
OP: Xc nh tp con ca X sao cho tng ca chng gn nht v khng
qu T.
DP: C tn ti tp con sao cho tng kch thc ng bng T.
2013-11-25
Mt s bi ton ti u ri rc
Bi ton phn cng cng vic:
Gi thit c n cng vic:
Mi thi im ch thc hin mt cng vic,
Thi hn hon thnh d1, d2, ..., dn (tnh t khi bt u cng vic u tin),
P() min.
P() k.
2013-11-25
Lp P
Thut ton c phc tp O(f(n)) nu vi mi b s liu c di n, s
php tnh phi thc hin khng qu C*f(n), vi C >0.
Thut ton c phc tp O(p(n)), vi p(n) l mt a thc, gi l c
phc tp a thc.
nh ngha:
2013-11-25
Lp NP (Nondeterministic Polynomial)
2013-11-25
Lp NP (Nondeterministic Polynomial)
Thut ton bt nh (nondeterministic algorithm):
Pha bt nh:
Mt xu k t S bt k c sinh ra trong b nh, c th coi nh
li gii ngh.
Pha tin nh:
c d liu vo (S c th b b qua). Thut ton c th kt thc vi
khng nh Yes, No, hoc ri vo vng lp khng dng.
C th coi l pha kim tra li gii ngh S.
Lp NP
2
5
3
2013-11-25
V d:
Output
Reason
RGRBG
No
nh 2 v 5 cng mu
RGRB
No
nh 5 khng c t mu
RBYGO
No
Dng ti 5 mu
RGRBY
Yes
10
Lp P vs. NP
Hin nhin:
P NP
NP \ P = ?
(NP P?)
NP
P
Sp xp
Cy khung b nht
Nhn ma trn
Tm kim tun t
ng i ngn nht
...
2013-11-25
Bi ton ci ti
Bi ton ba l
Bi ton ngi du lch
11
NP-y (NP-complete)
Hin nhin:
P NP.
Nhng:
NP \ P = ?
Chng minh c:
Trong NP c nhng bi ton kh khng
km bt c bi ton no khc trong NP.
A NP: nu c mt thut ton a thc
no gii c A th vi mi bi ton B
NP u c thut ton a thc gii B.
NP
P
Sp xp
Cy khung b nht
Nhn ma trn
Tm kim tun t
ng i ngn nht
...
Bi ton ci ti
Bi ton ba l
Bi ton ngi
du lch
Bi ton A c gi l NP-y .
12
NP-y (NP-complete)
Hin nhin:
P NP.
Nhng:
NP \ P = ?
Chng minh c:
1. Nu NP P th c bi
ton thuc NP nhng
khng thuc P v cng
khng phi NP-y .
P
Sp xp
Cy khung b nht
Nhn ma trn
Tm kim tun t
ng i ngn nht
...
NP
NPy
2013-11-25
13
NP-y (NP-complete)
P
NP
Sp xp
Cy khung b
nht
Nhn ma trn
Tm kim tun t
ng i ngn
nht
...
NPy
2013-11-25
14
NP-y (NP-complete)
Gi thit cn gii bi ton A v c thut ton gii bi ton B.
Gi s c nh x T chuyn mi d liu vo x ca bi ton A thnh d liu
vo T(x) ca bi ton B
T: x T(x)
sao cho:
Li gii y ca bi ton A vi d liu vo x
tng ng vi
Li gii z ca bi ton B vi d liu vo T(x)
(nu y l yes th z cng l yes).
Thut ton gii bi ton A = {nh x T + Thut ton gii B}
2013-11-25
15
Bi ton CNF-SAT
M t:
1)
2)
3)
Bin logic nhn mt trong hai gi tr: true hoc false. K hiu a l bin
logic, l ph nh ca a. Nu a nhn gi tr true th nhn gi tr false v
ngc li, nu a nhn gi tr false th nhn gi tr true. Mt tn bin l
mt bin logic hoc ph nh ca bin logic (cng l mt bin logic).
Mt mnh l mt dy cc tn bin c xen k bi php ton logic
OR ().
Mt biu thc logic trong dng lin kt chun (conjunction nomal form CNF) l mt dy cc mnh c kt ni bi php ton AND ().
2013-11-25
16
Bi ton CNF-SAT
nh l Cook:
Bi ton CNF-SAT l NP-y
2013-11-25
17
Bi ton CNF-SAT
nh l Cook:
Bi ton CNF-SAT l NP-y
x
d liu
vo
ca A
T(x)
CNF-SAT
yes
hoc
no
Algorithm for A
2013-11-25
18
Bi ton CNF-SAT
V d: Xt bi ton 3-CG:
th G ={V,E} nh hnh v
c t c bng 3 mu?
2013-11-25
19
Bi ton CNF-SAT
u1
u2
K hiu: xkj nh k t bi mu j
Xt 32 mnh :
C(k) = {xk1, xk2, xk3}, nh k c t bi t nht 1 mu
A(k) = {xk1, xk2,}, nh k khng cng c t mu 1 v 2
u3
u4
nh k khng cng c t mu 2 v 3
nh k khng cng c t mu 1 v 3
k = a, b, c, d
2013-11-25
20
Bi ton CNF-SAT
u1
u2
G l th 3 mu ch
khi M&N c gi tr
true.
u3
u4
N=
D((u1,u2),1)&D((u1,u3),1)&D((u1,u4),1)& D((u2,u3),1)&D((u2,u4),1)&D((u3,u4),1)
&...&
D((u1,u2),3)&D((u1,u3),3)&D((u1,u4),3)& D((u2,u3),3)&D((u2,u4),3)&D((u3,u4),3)
N=
2013-11-25
21
NP-y
2013-11-25
22
NP-y
Nu
i=1,..,nsi < T
bi ton tp con khng c li gii.
C th chuyn dn phng n thnh bt k d liu vo cho
bi ton phn cng cng vic m khng c li gii.
V d:
ti= 2, di = pi = 1, vi i = 1, 2, ..., n.
and k=0.
(Bi ton quyt nh:
C tn ti mt tp con sao cho tng ng bng T?
C tn ti mt lch cng tc m tng gi tr pht P k ?.)
2013-11-25
23
NP-y
Xt trng hp i=1,..,nsi T
t
ti = si,
di = T,
pi = si, vi i = 1, ..., n v
k = i=1,..,nsi T.
|J |
|J |
i 1
iJsi = T
t:
:J
: NS\J
{ 1, 2, ..., |J|},
{ |J|+1,...,n},
si s ( i ) t ( i ) T
i J
Gi s J NS = {1, 2,...,n}
t ( i ) T ,
i 1
j 1, 2, ..., | J |
i 1
i | J |1
i | J |1
i 1
p ( i ) s ( i ) s i s i s i T k
2013-11-25
i J
i 1
24
NP-y
i m 1
i 1
t (i ) T
i 1
p (i ) k si T
i m1
i 1
i 1
i m1
s (i ) si T s (i ) s (i ) T
m
T s (i )
i 1
s (i) T
i 1
Vy
s(1), s(2), ..., s(m)
l li gii bi ton tng
tp con.
2013-11-25
25
NP-y
S chng minh A l bi ton NP-y :
Ch ra rng A thuc lp NP;
Chn bi ton NP-y no , v d l B v chuyn dn B v A
Tht vy:
A l NP-y nu
A thuc lp NP v
mi bi ton X thuc lp NP c XA.
B l NP-y nn mi bi ton C trong
NP:
CB
Do BA,
suy ra
CA.
Ngha l mi bi ton C trong NP u
chuyn dn v A c.
2013-11-25
26
NP-y
2013-11-25
27
Remark
2013-11-25
28