average-case approximation

pseudorandomness

PCP
PSPACE IP ZK

PH
BPP RP
NP coNP
P
NL
L lower bounds
 10.1.1 10.1.2 10.2
approx. prop. average
(of opt.) test. case

9.2 ZK 9.3 8.2 8.3 8.4 8.5

7.1 7.2 gen.
pur. de-ran. space
9.1 IP PCP OWF in E
8.1 paragidm
7.1.3

6.1 6.2
rand. count.

6.1.4
(RL)

5.2.4 5.3.1

4.3 space 5.2 5.3 5.4

3.1 3.2
4.2 TIME L NL PSPACE
P/poly PH
4.1 advice 5.1 general
3.2.3
 b

5 3 2 2 2 3 1 0 - - - - - - - -

5 3 2 2 2 3 3 0 - - - - - - - -
1 2 4 3

neg neg neg

and and and

and
0
or
or

1 2
PARITY PARITY PARITY PARITY PARITY PARITY
of x .... x of x ...x of x .... x of x ...x of x .... x of x ...x
1 n n+1 2n 1 n n+1 2n 1 n n+1 2n

neg neg neg neg

and and
and and

or
or
(1,a) (1,-) (0,-) (y1,-) (y2,-) (-,-) (-,-) (-,-) (-,-) (-,-) initial configuration
(with input 110y1y2 )
(3,-) (1,b) (0,-) (y1,-) (y2,-) (-,-) (-,-) (-,-) (-,-) (-,-)

(3,-) (1,-) (0,b) (y1,-) (y2,-) (-,-) (-,-) (-,-) (-,-) (-,-)

(3,-) (1,c) (0,-)

(3,c) (1,-) (0,-)

(1,-) (1,f) (0,-)

last configuration
 1 2 3
1 2 3 3
g1 g1 g2 g2 g3 g3 g4 g4
gate1 and

or and neg
and
gate2 or
eq
eq eq eq

gate3 and
and

gate4 neg
 2 x T1
1
M
3 y T2

T3
GROUND FALSE
the two designated verices

variable gadgets

clause gadgets
 NP
NPC

P
coNPC
coNP
x x x
A1 A1 A1

f1(x) f1(x) f1(x)

counters

A2 A2 A2

f(x) f(x) f(x)

 x

+x +x

+x -x
entry1 entry2 entry3

LB1 LB2 LB3

exit1 exit2 exit3

x
f(x)

b(x)
 via list decoding (7.2.1.3)

mild
worst-case Yao’s XOR
average-case inapprox.
HARDNESS 7.2.1.1 HARDNESS 7.2.1.2

derandomized
Yao’s XOR (7.2.2)
seed output sequence
Gen

?
a truly random sequence
 i
Hk
xi G1 xi+1 ... G1 xl

!i !i+1 !l

!1 . . . !i-1 !i !i+1 . . . !l
 "
(3)
0 1 (possible) application of h

"0 "1 (possible) application

0 1 0 1 (2)
of h
"00 "01 "10 "111
(possible)
application
0 1 0 1 0 1 0 1 (1)
of h
"000 "001 "010 "011 "100 "101 "110 "111
 m(k)

b(k)
+ =
r0 r1 ri-t-1 ri-t ri-t+1 ri-1 ri

f0 f1 ft-1

#
X X is true!
??
?
!
?
!
!
r s r " " s

A = = f"(r). f"(s)
 8
9
10
3 20
11
16
4 17 21
12 1 18
5 7 22

13 2 19
14 u v w

6 23
15

u w
8 9 10
1 2 v v 18 19

3 4 5 u 7 20
19
6 7 w 23
tpcBPP

sampNP

distNP
sampNP-complete [Thm 10.25]

distNP-complete [Thm 10.17 and 10.19]

 one-way functions exist

distNP is not in tpcBPP

(equiv., sampNP is not in tpcBPP)

P is different than NP
u 1
v
1
6 2

6 2

5 3

5 3
4

4
The original MA game The new AM game

Merlin Arthur Merlin Arthur

$
(1)
" . . ."
(t)

" $
The MAMA game The AMA game

Merlin Arthur Merlin Arthur

$1
(1)
"1 ... (t)
"1

"1 $1
(1) (t)
$2 $2
$2
i
"2 "2