NPTEL Video Course : NOC:Randomized Algorithms


Lecture 38 - Probabilistically checkable proofs - III


            


DIGIMAT Digital Learning Platform