CSE 589Applied AlgorithmsSpring 1999

Table of Contents

CSE 589Applied AlgorithmsSpring 1999

NP-Completeness Theory

NP

Examples of Decision Problems in NP

CNF-Satisfiability

Subset Sum

Decision Problems are Polynomial Time Equivalent to their Reporting Problems

Reporting Reduces to Decision

Polynomial Time Reducibility

Block Diagram to Decide A from B

Example of Polynomial Time Reduction

NP-Hardness

Transitivity of Polynomial Time Reduction

NP-Completeness Definition

Cook’s Theorem

P vs NP

Probable Picture

Clique Decision Problem

Clique Example

Clique is NP-Complete

Construction by Example

Construction by Example

General Construction

The Reduction Argument

Clique to Assignment

Assignment to Clique

3-CNF-Satifiability

Reduction by Example

Email: ladner@cs.washington.edu

Home Page: http://www.cs.washington.edu/education/courses/589/CurrentQtr/

Other information:
CSE 589: Applied Algorithms

Download presentation source