NPTEL Video Course : NOC:Basics of Computational Complexity

Lecture 48 - P-completeness and NEXP-completeness