18.404/6.840 Lecture 15 1 Quick Review NP = All
Description: 18.4046.840 Lecture 15 1 Quick Review NP All languages where can verify membership quickly P All languages where can test membership quickly P versus NP question: Does P NP? 2 3 4 Check-in 15.1 Check-in 15.1 Does this proof require 3
Related Topics
Download Presentation
"18.404/6.840 Lecture 15 1 Quick Review NP = All" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
slide1. 18.404/6.840 Lecture 15 1<br>
slide2. Quick Review NP = All languages where can verify membership quickly
P = All languages where can test membership quickly
P versus NP question: Does P = NP? 2<br>
slide3. 3<br>
slide4. 4<br>
slide5. Check-in 15.1 Check-in 15.1
Does this proof require 3 literals per clause?
Yes, to prove the claim.
Yes, to show it is in poly time.
No, it works for any size clauses. 5<br>
slide6. NP-completeness today Check-in 15.2 6<br>
slide7. variable gadget . . . Zig-zag Zag-zig 7<br>
slide8. Check-in 15.3 8<br>
slide9. Problem Set 4 9<br>
slide10. Quick review of today 10<br>
slide11. MIT OpenCourseWare
https://ocw.mit.edu
18.404J Theory of Computation
Fall 2020
For information about citing these materials or our Terms of Use, visit: https://ocw.mit.edu/terms.<br>
slide2. Quick Review NP = All languages where can verify membership quickly
P = All languages where can test membership quickly
P versus NP question: Does P = NP? 2<br>
slide3. 3<br>
slide4. 4<br>
slide5. Check-in 15.1 Check-in 15.1
Does this proof require 3 literals per clause?
Yes, to prove the claim.
Yes, to show it is in poly time.
No, it works for any size clauses. 5<br>
slide6. NP-completeness today Check-in 15.2 6<br>
slide7. variable gadget . . . Zig-zag Zag-zig 7<br>
slide8. Check-in 15.3 8<br>
slide9. Problem Set 4 9<br>
slide10. Quick review of today 10<br>
slide11. MIT OpenCourseWare
https://ocw.mit.edu
18.404J Theory of Computation
Fall 2020
For information about citing these materials or our Terms of Use, visit: https://ocw.mit.edu/terms.<br>