Lecture 19 P-Complete Problems

1
Lecture 19 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
(No Transcript)
8
Monotone Circuit Value (MCV)
THEOREM
PROOF
9
Odd Maximum Flow (OMF)
THEOREM
PROOF
10
(No Transcript)
11
Reduce fanout
Add OR gate as output gate
12
(No Transcript)
13
(No Transcript)
14
(No Transcript)
15
(No Transcript)
16
(No Transcript)
17
(No Transcript)
18
(No Transcript)
19
(No Transcript)
20
Thanks, end.