Learn · Topics In Theoretical Computer Science,2018 - Chennai Mathematical Institute
Lecture 5 of 9Topics In Theoretical Computer Science - Chennai Mathematical Institute
Complexity Theory-Prof. Jayalal Sarma, IITM
IIT Madras
Credits and licence
- From
- Topics In Theoretical Computer Science,2018 - Chennai Mathematical Institute, IIT Madras (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Finite Automata-Prof. N S Narayanaswamy, IITM
- TMs, Halting Problems-Prof. N S Narayanaswamy, IITM
- Concurrency-Prof. Madhavan Mukund, CMI
- Blockchain and Bitcoin-Prof. S P Suresh,CMI
- Complexity Theory-Prof. Jayalal Sarma, IITM
- Lower Bounds, Dealing with NP hardness-Prof. Venkatesh Raman,IMSC
- Online and streaming algorithms-Prof. Prajakta Nimbhorkar,CMI
- Zero Knowledge Proofs-Prof. Meena Mahajan,IMSC
- Verification, Games-Prof. Madhavan Mukund, CMI