Modules / Lectures
Module NameDownload


Sl.No Chapter Name MP4 Download
1Lecture 1: Introduction Download
2Lecture 2: NP Completeness Download
3Lecture 3: SAT is NP-complete Download
4Lecture 4: More on NP completeness Download
5Lecture 05: Hierarchy Theorems Download
6Lecture 06: Introduction to Space Complexity Download
7Lecture 07: Savitch’s Theorem Download
8Lecture 08: Immerman-Szelepscenyi Theorem Download
9Lecture 09: Polynomial Hierarchy Download
10Lecture 10: A PSPACE Complete Problem Download
11Lecture 11: More on Polynomial Hierarchy Download
12Lecture 12: Alternating Turing Machines Download
13Lecture 13: Equivalence of Quantifier and Oracle Based Definitions of Polynomial Hierarchy Download
14Lecture 14: Boolean Circuits Download
15Lecture 15: Shannon’s Theorem and Karp-Lipton-Sipser TheoremDownload
16Lecture 16: Bounded Depth Circuit Classes Download
17Lecture 17: Kannan’s Theorem Download
18Lecture 18: Probabilistic Complexity Download
19Lecture 19: StrongBPP and WeakBPP Download
20Lecture 20: One-sided and Zero-sided Error Probabilistic Complexity Classes Download
21Lecture 21: Error Reduction for BPP Download
22Lecture 22: BPP in PH and Logspace Randomized Classes Download
23Lecture 23: Valiant-Vazirani Theorem - I Download
24Lecture 24: Valiant-Vazirani Theorem - I Download
25Lecture 25: Amplified version of Valiant-Vazirani Theorem Download
26Lecture 26: Toda’s Theorem - I Download
27Lecture 27: Toda’s Theorem - II Download
28Lecture 28: Permanent and Determinant Functions Download
29Lecture 29: Permanent is hard for #P Download
30Lecture 30: Interactive Proofs Download
31Lecture 31: Graph Non-Isomorphism is in IP[2] Download
32Lecture 32: Set Lower Bound Protocol Download
33Lecture 33: MA is in AM Download
34Lecture 34: Sumcheck Protocol - IDownload
35Lecture 35: Sumcheck Protocol - IIDownload
36Lecture 36: Parity not in AC0 - IDownload
37Lecture 37: Parity not in AC0 - IIDownload
38Lecture 38 : Circuits with CountersDownload
39Lecture 39 : Communication Complexity - IDownload
40Lecture 40 : PCP TheoremDownload
41Lecture 41 : Communication Complexity - IIDownload

Sl.No Chapter Name English
1Lecture 1: Introduction Download
To be verified
2Lecture 2: NP Completeness Download
To be verified
3Lecture 3: SAT is NP-complete Download
To be verified
4Lecture 4: More on NP completeness Download
To be verified
5Lecture 05: Hierarchy Theorems Download
To be verified
6Lecture 06: Introduction to Space Complexity Download
To be verified
7Lecture 07: Savitch’s Theorem Download
To be verified
8Lecture 08: Immerman-Szelepscenyi Theorem Download
To be verified
9Lecture 09: Polynomial Hierarchy Download
To be verified
10Lecture 10: A PSPACE Complete Problem Download
To be verified
11Lecture 11: More on Polynomial Hierarchy Download
To be verified
12Lecture 12: Alternating Turing Machines Download
To be verified
13Lecture 13: Equivalence of Quantifier and Oracle Based Definitions of Polynomial Hierarchy Download
To be verified
14Lecture 14: Boolean Circuits Download
To be verified
15Lecture 15: Shannon’s Theorem and Karp-Lipton-Sipser TheoremDownload
To be verified
16Lecture 16: Bounded Depth Circuit Classes Download
To be verified
17Lecture 17: Kannan’s Theorem Download
To be verified
18Lecture 18: Probabilistic Complexity Download
To be verified
19Lecture 19: StrongBPP and WeakBPP Download
To be verified
20Lecture 20: One-sided and Zero-sided Error Probabilistic Complexity Classes Download
To be verified
21Lecture 21: Error Reduction for BPP Download
To be verified
22Lecture 22: BPP in PH and Logspace Randomized Classes Download
To be verified
23Lecture 23: Valiant-Vazirani Theorem - I Download
To be verified
24Lecture 24: Valiant-Vazirani Theorem - I Download
To be verified
25Lecture 25: Amplified version of Valiant-Vazirani Theorem Download
To be verified
26Lecture 26: Toda’s Theorem - I Download
To be verified
27Lecture 27: Toda’s Theorem - II Download
To be verified
28Lecture 28: Permanent and Determinant Functions PDF unavailable
29Lecture 29: Permanent is hard for #P PDF unavailable
30Lecture 30: Interactive Proofs PDF unavailable
31Lecture 31: Graph Non-Isomorphism is in IP[2] PDF unavailable
32Lecture 32: Set Lower Bound Protocol PDF unavailable
33Lecture 33: MA is in AM PDF unavailable
34Lecture 34: Sumcheck Protocol - IPDF unavailable
35Lecture 35: Sumcheck Protocol - IIPDF unavailable
36Lecture 36: Parity not in AC0 - IPDF unavailable
37Lecture 37: Parity not in AC0 - IIPDF unavailable
38Lecture 38 : Circuits with CountersPDF unavailable
39Lecture 39 : Communication Complexity - IPDF unavailable
40Lecture 40 : PCP TheoremPDF unavailable
41Lecture 41 : Communication Complexity - IIPDF unavailable


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