1 / 20

Lecture 3-4 P-Complete Problems

Lecture 3-4 P-Complete Problems. Log-space many-one reduction. DEFINITION. PROPERTY. P-complete. Circuit Value Problem (CVP). THEOREM. PROOF. SIMULATE DTM COMPUTATION BY A CIRCUIT. Planar Circuit Value (PCV). THEOREM. PROOF. Monotone Circuit Value (MCV). THEOREM. PROOF.

hclose
Download Presentation

Lecture 3-4 P-Complete Problems

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 3-4 P-Complete Problems

  2. Log-space many-one reduction DEFINITION PROPERTY

  3. P-complete

  4. Circuit Value Problem (CVP) THEOREM PROOF

  5. SIMULATE DTM COMPUTATION BY A CIRCUIT

  6. Planar Circuit Value (PCV) THEOREM PROOF

  7. Monotone Circuit Value (MCV) THEOREM PROOF

  8. Odd Maximum Flow (OMF) THEOREM PROOF

  9. Reduce fanout Add OR gate as output gate

  10. Why it is a max flow? full s, true nodes t, false nodes 0

  11. Thanks, end.

More Related