------------------------------------------------
COMP SCI 731 - Lecture 2 - Tuesday, Oct 31, 2000
------------------------------------------------

Today: o Review
       o An example reduction

Review
------

1. A way to give evidence for a problem being hard
2. NP and hardest problems in NP
3. Reductions
4. 3SAT
5. CLIQUE


An example reduction
--------------------

Describe the reduction from 3SAT to k-clique.
Check the running time of the reduction.
Show that the reduction works, proving both directions.

+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Problem 0.  Find the smallest 3CNF formula phi such that phi is NOT 
            satisfiable.  Prove that this is the smallest such formula.
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++