CSE 200 Final Exam
Due Wed. June 9 at 1 AM (OK, I won’t actually check until I get in in the
morning. But all exams must be turned in before I arrive in my o±ce.)
Answer four out of ²ve questions with an informal, but complete, proof.
You
may not discuss this exam with anyone except myself and William, whether
taking the course or not.
Each question has equal weight, but some are more
di±cult than others.
You may cite without proof any result from the Arora
Barak or Sipser text or proved in class. In particular, you can use without proof
the
NP
completeness of any problem proved
NP
complete in class, in the two
texts, or on the homeworks, including: SAT, 3SAT, Independent Set, Clique,
Vertex Covering, 3coloring, Hamiltonian Circuit, and Subset Sum.
However,
you may not use the list of
NP
complete problems in the appendix of Garey
and Johnson without proof.
Computability
Give an example of a language that is not decideable even
with an oracle for the Halting Problem, i.e., that is not Turing reducible
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Winter '12
 Edmonds
 Computational complexity theory, NPCompleteness Prove, B. NPCompleteness Prove, probabilistic computation Prove

Click to edit the document details