QB5 - NPC

# QB5 - NPC - COMP 271 Design and Analysis of Algorithms 2003...

This preview shows pages 1–2. Sign up to view the full content.

COMP 271 Design and Analysis of Algorithms 2003 Spring Semester Question Bank 5 There is some overlap between these question banks and the tutorials. Solving these questions (and those in the tutorials) will give you good practice for the midterm. Some of these questions (or similar ones) will deFnitely appear on your exam! Note that you do not have to submit answers to these questions for grading. Your TAs will discuss answers to selected questions in the tutorials. 1. Prove that P Co-NP . 2. Prove that if NP 6 = Co-NP then P 6 = NP . 3. Aliens from another world come to Earth and tell us that the 3-SAT problem is solvable in O ( n 8 ) time. Which of the following statements follow as a consequence? (List all that are true.) (i) All NP-complete problems are solvable in polynomial time. (ii) All NP-complete problems are solvable in O ( n 8 ) time. (iii) All problems in NP, even those that are not NP-complete, are solvable in polynomial time. (iv) No NP-complete problem can be solved faster than in

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.

## This note was uploaded on 10/18/2009 for the course COMP 271 taught by Professor Arya during the Spring '07 term at HKUST.

### Page1 / 2

QB5 - NPC - COMP 271 Design and Analysis of Algorithms 2003...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online