Metadata
Title
Jan
Category
courses
UUID
9c4d86e537a54cf6807259162e545c38
Source URL
https://moodle.cse.iitk.ac.in/course/index.php
Parent URL
https://moodle.cse.iitk.ac.in/
Crawl Time
2026-03-18T08:10:36+00:00
Rendered Raw Markdown

Jan

Source: https://moodle.cse.iitk.ac.in/course/index.php Parent: https://moodle.cse.iitk.ac.in/

CS640: Computational Complexity Theory

CS648A: Randomized Algorithms

Review of discrete probability; Notion of randomized algorithms, motivating examples; Markov, Chebyshev inequalities, Chernoff bounds; Probabilistic method; Hashing, fingerprinting; Random walks and Markov chains. Program checkers; Polynomial identities; Randomized complexity classes, Probabilistically checkable proofs; some number theoretic problems; Approximate counting.\