Remarkable Theorem of Steve Cook (1971)Proved that there exist NP-complete problems

• The Satisfiability problem is NP-complete.

• Satisfiability: Given a boolean formula in conjunctive normal form (and of ors), is there an assignment of the variables to 0’s and 1’s so that the resulting formula evaluates to 1?

• Example:

Previous slide

Next slide

Back to first slide

View graphic version