| Module Name | Download |
|---|
| Sl.No | Chapter Name | MP4 Download |
|---|---|---|
| 1 | Lecture 1: Course Outline | Download |
| 2 | Lecture 2 Circuits and Polynomial Identity Testing | Download |
| 3 | Lecture 3: Derandomization and Lower Bounds | Download |
| 4 | Lecture 4: IP=PSPACE | Download |
| 5 | Lecture 5: ACC0 Lower Bounds | Download |
| 6 | Lecture 6: ACC0 Lower Bounds Continued. | Download |
| 7 | Lecture 7: Monotone Circuits | Download |
| 8 | Lecture 8: Monotone Circuit Lower Bound and Sunflower Lemma. | Download |
| 9 | Lecture 9: Undirected Graph Connectivity in randomized logspace. | Download |
| 10 | Lecture 10: Graph Expansion Properties. | Download |
| 11 | Lecture 11: Expanders | Download |
| 12 | Lecture 12: Error Reduction using Expanders | Download |
| 13 | Lecture 13: Ajtai-Komlos-Szemeredi Theorem | Download |
| 14 | Lecture 14: Explicit construction of expanders and Zig-Zag product | Download |
| 15 | Lecture 15: Spectral analysis of Zig-Zag product | Download |
| 16 | Lecture 16: Undirected Path in logspace | Download |
| 17 | Lecture 17: Explicit Prg to derandomizing classes | Download |
| 18 | Hardness vs Randomness. | Download |
| 19 | Hardness to NW-Generator to PRG | Download |
| 20 | Lecture 20: Partial derandomization from worst-case hardness of permanent | Download |
| 21 | Lecture 21: Error-correcting codes | Download |
| 22 | Lecture 22: Introduction to various linear explicit codes | Download |
| 23 | Lecture 23: Introduction of efficient decoding | Download |
| 24 | Lecture 24: Local decoding of WH, Reed-Muller and Concatenated codes | Download |
| 25 | Week 25: Introduction to List Decoding | Download |
| 26 | Lecture 26: Local List decoding of WH, RM | Download |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | Lecture 1: Course Outline | Download To be verified |
| 2 | Lecture 2 Circuits and Polynomial Identity Testing | Download To be verified |
| 3 | Lecture 3: Derandomization and Lower Bounds | Download To be verified |
| 4 | Lecture 4: IP=PSPACE | Download To be verified |
| 5 | Lecture 5: ACC0 Lower Bounds | Download To be verified |
| 6 | Lecture 6: ACC0 Lower Bounds Continued. | Download To be verified |
| 7 | Lecture 7: Monotone Circuits | Download To be verified |
| 8 | Lecture 8: Monotone Circuit Lower Bound and Sunflower Lemma. | Download To be verified |
| 9 | Lecture 9: Undirected Graph Connectivity in randomized logspace. | Download To be verified |
| 10 | Lecture 10: Graph Expansion Properties. | Download To be verified |
| 11 | Lecture 11: Expanders | Download To be verified |
| 12 | Lecture 12: Error Reduction using Expanders | Download To be verified |
| 13 | Lecture 13: Ajtai-Komlos-Szemeredi Theorem | Download To be verified |
| 14 | Lecture 14: Explicit construction of expanders and Zig-Zag product | PDF unavailable |
| 15 | Lecture 15: Spectral analysis of Zig-Zag product | PDF unavailable |
| 16 | Lecture 16: Undirected Path in logspace | PDF unavailable |
| 17 | Lecture 17: Explicit Prg to derandomizing classes | PDF unavailable |
| 18 | Hardness vs Randomness. | PDF unavailable |
| 19 | Hardness to NW-Generator to PRG | PDF unavailable |
| 20 | Lecture 20: Partial derandomization from worst-case hardness of permanent | PDF unavailable |
| 21 | Lecture 21: Error-correcting codes | PDF unavailable |
| 22 | Lecture 22: Introduction to various linear explicit codes | PDF unavailable |
| 23 | Lecture 23: Introduction of efficient decoding | PDF unavailable |
| 24 | Lecture 24: Local decoding of WH, Reed-Muller and Concatenated codes | PDF unavailable |
| 25 | Week 25: Introduction to List Decoding | PDF unavailable |
| 26 | Lecture 26: Local List decoding of WH, RM | PDF unavailable |
| Sl.No | Language | Book link |
|---|---|---|
| 1 | English | Not Available |
| 2 | Bengali | Not Available |
| 3 | Gujarati | Not Available |
| 4 | Hindi | Not Available |
| 5 | Kannada | Not Available |
| 6 | Malayalam | Not Available |
| 7 | Marathi | Not Available |
| 8 | Tamil | Not Available |
| 9 | Telugu | Not Available |