Module NameDownload


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

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


Sl.No Language Book link
1EnglishNot Available
2BengaliNot Available
3GujaratiNot Available
4HindiNot Available
5KannadaNot Available
6MalayalamNot Available
7MarathiNot Available
8TamilNot Available
9TeluguNot Available