NP-Completeness
A brief review of NP-Completeness
`Tractable' problems and `Intractable' problems.
A tractable problem is polynomial-time solvable
on its input size under the computational model of
5F D i F X h
f#qPyuh EB
w
GB
w5r
gtsI sPePi
Y r IB c X wF
n
l EB
x
Qw
`#i
Q
vD
6w
i l
5 HsI GB ytPya
YB F i Y X w QF X
Y 5F D X c
P9eda
X t QI
bI 9RPB
VFB DB @ 8 6 5 c 5F D Y c X h w i c
sHGgd(r f#i u
2 0 7u v x x w u
0( (
(mk(x
Xn1v"Y e c aa Y h
(2
e c a k d Aep d ep
Yx
j vj
tt
u a Y uu d x ( vu (
cfw_ab|lcfw_2 zyg dPw1bt 0
p ~ d lu g
ud
Y Xq|i Xcfw_ x w u Y
( m kj
( vx AAwecfw_2 v !v"Y
~
vj j vj
CS6743 Assignment 1
due date: Feb. 26, 2014
1. Design a Turing machine to decide the following languages over the alphabet cfw_0, 1. (i.e., to
describe a high-level algorithm for a machine to decide t
MUN CS 6743
Oct 11, 2007
Homework Assignment #2
Due: Oct 30, 2007
1. For each of the problems below, state whether you think that the problem is NP-complete. Justify
your answer by either proving it t
CS6743 Assignment 2
due date: March. 26, 2014
1. Show P is closed under union, concatenation, and complement.
2. Show N P is closed under union, concatenation, and the star operation.
3. Show that if
CS 6743
1
Lecture 11 1
Fall 2007
More NP-complete problems
1.1
SubsetSum
Theorem 1. SubsetSum is NP-complete
Proof. We already have seen that SubsetSum is in NP (guess S, check that the sum is equal
t
MUN CS 6743
Sep 24, 2007
Homework Assignment #1
Due: Oct 9, 2007
[15]
1. Turing machines: two-way innite tape
Suppose that we change the denition of a Turing machine to have a tape that is innite in b
CS6743 Take Home Examination
Due date: 5:00pm, July 9, 2011 (submit your answer in PDF or MS-word le to
[email protected]).
1. Consider the following algorithm for SAT problem: For every instance
of SAT ,
CS6743 Midterm Examination
(Take home examination.)
Due date: 5:00pm, November 16, 2006 (hand in your answer to my oce).
1. Consider the following algorithm for SAT problem: For every instance
of SAT
CS6743 course out-line
Instructor: Cao An Wang
Introduction (An overview of the course).
Turing Machines.
Non-deterministic Turing Machine
Universal Turing Machine
Properties of Algorithmic Compu
CS 6743
1
Lecture 18 1
Fall 2007
Interactive proof systems and graph non-isomorphism
The interactive protocols (IP) are also protocols between a probabilistic polytime Verier
and an all-powerful Prove