NPTEL Video Course : NOC:Computational Complexity Theory

Lecture 29 - Permanent is hard for #P