1 / 35

LECTURE 12-13 Complete Problems in PH

LECTURE 12-13 Complete Problems in PH. THEOREM. PROOF. BOUNDED HALTING PROBLEM (BHP). THEOREM. PROOF. A. BHP. LEMMA. PROOF. LEMMA. PROOF. DEFINITION. THEOREM. PROOF by induction on k. Natural Problem. (Machine unrelated). Machine Related Problem. SAT k. THEOREM.

lacota-santiago
Download Presentation

LECTURE 12-13 Complete Problems in PH

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. LECTURE 12-13Complete Problems in PH

  2. THEOREM PROOF

  3. BOUNDED HALTING PROBLEM (BHP) THEOREM PROOF

  4. A BHP LEMMA PROOF

  5. LEMMA PROOF

  6. DEFINITION THEOREM PROOF by induction on k

  7. Natural Problem (Machine unrelated) Machine Related Problem

  8. SAT k THEOREM

  9. PROOF (odd k)

  10. 3-CNF SAT k THEOREM

  11. Generalized Ramsey Number

  12. THEOREM PROOF Construction Such that

  13. Variables

  14. Variables Clauses

  15. Variables Clauses

  16. Variables Clauses

  17. Variables Clauses

  18. Variables Clauses

  19. Variables Clauses

  20. Variables Clauses

  21. Case 1 Answer:

  22. Case 2 Answer:

  23. Case 2 Answer:

  24. Consider To prove Define a coloring c’: No red clique of size K exists.

  25. Consider To prove Define a coloring c’: No red clique of size K exists. There must exist a blue clique Q of size K.

  26. PPROPERTY OF BLUE CLIQUE Q Assignment for y Then F(X,Y) is satisfied

  27. Thanks, end.

More Related