lec20-handout.pdf - Announcements CMPSCI 311 Introduction...

This preview shows 1 out of 3 pages.

CMPSCI 311: Introduction to Algorithms Lecture 20: Reductions and Intractability Akshay Krishnamurthy University of Massachusetts Last Compiled: April 23, 2018 Announcements Quiz due tonight HW 6 due 5/1 (Tuesday night!), and extra credit Midterms back on wednesday (Solutions up tonight) Last discussion on friday Final Exam: Friday 5/4, 3:30-5:30pm, Marcus Hall 131. Recap Problem X is a set of strings s , the YES instances. Algorithm A solves X if A ( s ) = true iff s X . B is polytime certifier for X if B is polytime algorithm of two inputs s and t (a hint). s X iff exists t with | t | ≤ p ( | s | ) and B ( s, t ) = True . P – class of problems with polytime algorithm. NP – class of problems with polytime certifier. X is NP-Complete iff Y P X for all Y ∈ NP . Example Problem ( X ) IndependentSet Instance ( s ) Graph G and number k Algorithm ( A ) Try all subsets and check ( Runtime? ) Hint ( t ) Which nodes are in the answer? Certifier ( B ) Are those nodes independent and size k ? Plan for today Review 3-SAT P CircuitSat HamCycle TSP Back to 3-SAT Claim. If Y is NP-complete and Y P X , then X is NP-complete. Theorem. 3-SAT is NP-Complete. Clearly in NP . Prove by reduction from CircuitSAT . Example. i1 i2 1 ¬ o
Image of page 1

Subscribe to view the full document.

The Reduction One variable x v per circuit node v .
Image of page 2
Image of page 3
You've reached the end of this preview.
  • Fall '09
  • Computational complexity theory, NP-complete problems, Travelling salesman problem, NP-complete, Hamiltonian path problem

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern