Download presentation
Presentation is loading. Please wait.
1
Randomized computation
姚鹏晖 助教: 刘明谋 答疑时间: 周四 2pm-4pm, 计算机科学与技术楼 502
2
What we have learnt Boolean circuits Complexity class P/poly, NC, AC
Existence of hard functions Nonuniform Hierarchy Theorem
3
Probability theory
4
Probability theory
5
Probabilistic Turing machines
6
BPTIME and BPP
7
Finding a median
8
Primality testing
9
Polynomial identity testing
10
Testing for perfect matching in a bipartite graph
11
One-sided error
12
Zero-sided error
13
The robustness of our definitions
14
Expected running time vs. worst-case running time
15
General random choices vs fair random coins
16
General random choices vs fair random coins
17
Randomness-efficient repetitions: a glimpse to peseurandomness
18
Randomness-efficient repetitions: a glimpse to peseurandomness
Similar presentations
![–Def: A language L is in BPP c,s ( 0 s(n) c(n) 1, n N) if there exists a probabilistic poly-time TM M s.t. : 1. w L, Pr[M accepts w] c(|w|),](/16/5094978/big_thumb.jpg "–Def: A language L is in BPP c,s ( 0 s(n) c(n) 1, n N) if there exists a probabilistic poly-time TM M s.t. : 1. w L, Pr[M accepts w] c(|w|),>")
