CS648A - Randomized Algorithms
Prerequisites:
3-0-0-9
Course Contents
Review of discrete probability; Notion of randomized algorithms, motivating examples; Markov, Chebyshev inequalities, Chern off bounds; Probabilistic method; Hashing, fingerprinting; Random walks and Markov chains. Program checkers; Polynomial identities; Randomized complexity classes, Probabilistically check able proofs; some number theoretic problems; Approximate counting.
Topics
Current Course Information
Instructor(s):
Number of sections:
Tutors for each section:
Schedule for Lectures:
Schedule for Tutorial:
Schedule for Labs: