# Jan

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

### [CS640: Computational Complexity Theory](https://moodle.cse.iitk.ac.in/course/view.php?id=183)

- Teacher: [Raghunath Tewari](https://moodle.cse.iitk.ac.in/user/view.php?id=22&course=1)

### [CS648A: Randomized Algorithms](https://moodle.cse.iitk.ac.in/course/view.php?id=182)

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.\

- Teacher: [Surender Baswana](https://moodle.cse.iitk.ac.in/user/view.php?id=844&course=1)