Transcription of Lecture 16: NP-Completeness - MIT OpenCourseWare
{{id}} {{{paragraph}}}
Example: confidence
Lecture 16: NP-Completeness - MIT OpenCourseWare
Lecture NP-Completeness Spring 2015. Lecture 16: NP-Completeness Introduction NP-hardness and NP-Completeness 3 SAT. 4. Super Mario Brothers 4. 3 Dimensional Matching 4. Subset Sum (weak). 4. Partition (weak). 4. Rectangle Packing (weak). 4. 4-Partition (strong). 4. Rectangle Packing (strong). 4. Jigsaw Puzzles NP-Hard and NP-Complete problems Today, we discuss NP-Completeness . Recall from : P = the set of problems that are solvable in polynomial time. If the problem has size n, the problem should be solved in nO(1).
Lecture NP-Completeness Spring 2015 • A problem X is NP-hard if every problem Y ∈ NP reduces to X. – If P =NP,then X/ ∈ P. • A reduction from problem A to problem B is a …
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: