NPTEL Video Course : NOC:Randomized Algorithms


Lecture 36 - Probabilistically checkable proofs - I


            


DIGIMAT Learning Management Platform