Media Summary: FPTAS (knapsack), FPRAS (DNF counting), semidefinite programming, Goemans-Williamson MAXCUT Contents: - randomized complexity classes ZPP, BPP, PP, RP and co-RP - PP contains NP and co-NP - RP cap co-RP = ZPP ... Alon's JL lower bound, beyond worst case analysis: suprema of gaussian processes, Gordon's theorem.
Advanced Algorithms Lecture 12 - Detailed Analysis & Overview
FPTAS (knapsack), FPRAS (DNF counting), semidefinite programming, Goemans-Williamson MAXCUT Contents: - randomized complexity classes ZPP, BPP, PP, RP and co-RP - PP contains NP and co-NP - RP cap co-RP = ZPP ... Alon's JL lower bound, beyond worst case analysis: suprema of gaussian processes, Gordon's theorem. Topics discussed: - More on shortest paths (Dijkstra's Hashing: load balancing, k-wise independence, chaining, linear probing.
