NPTEL Video Course : NOC:Randomized Algorithms
Lecture 37 - Probabilistically checkable proofs - II
Home
Previous
Next
Thumbnails