随机算法课程笔记

Randomized Algorithms · 2025 Spring

Pr[X > a] ≤ E[X]/a

Lecture 11

2025 / 3 / 24
Hamilton Cycles (2) Balls and Bins (1)

Lecture 10

2025 / 3 / 20
Randomized Routing Hamilton Cycles (1)

Lecture 9

2025 / 3 / 17
Network Reliability (2) Chernoff Bounds

Lecture 8

2025 / 3 / 13
DNF Counting Network Reliability (1)

Lecture 7

2025 / 3 / 10
Double Hashing Buffon's Needle Median Trick

Lecture 6

2025 / 3 / 6
Pairwise Independence Probability Amplification Derandomization Universal Hashing

Lecture 5

2025 / 3 / 3
Monotone Circuits Majority Function

Lecture 4

2025 / 2 / 27
Unbalancing Lights Large Girth and Chromatic Number MAX3SAT 4-Cliques

Lecture 3

2025 / 2 / 24
Primality Probabilistic Method Independent Set Crossing Number

Lecture 2

2025 / 2 / 20
Bipartite Matching Perfect Matching in Parallel Fingerprinting

Lecture 1

2025 / 2 / 17
Matrix Multiplication Associativity Polynomial Identities