Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
0 of .
Results for:
P. 1
Tututrial On NP

Tututrial On NP

Ratings: (0)|Views: 108 |Likes:

Availability:

See more
See less

10/20/2010

pdf

text

original

CSC5160Topics in AlgorithmsTutorial 2
Introduction to NP-Complete Problems
Feb 8 2007Jerry Le jlle@cse.cuhk.edu.hk

Outline
General definitions
- P, NP, NP-hard, NP-easy, and NP-complete...- Polynomial-time reduction
Examples of NP-complete problems

General Definitions
P, NP, NP-hard, NP-easy, and NP-complete
Problems- Decision problems (yes/no)- Optimization problems (solution with best score)P- Decision problems (decision problems) that can be solved inpolynomial time- can be solved “efficiently”NP- Decision problems whose “
YES
” answer can be verified inpolynomial time, if we already have the
proof
(or
witness
)co-NP- Decision problems whose “
NO
” answer can be verified inpolynomial time, if we already have the
proof
(or
witness
)