NPTEL Video Course : NOC:Basics of Computational Complexity


Lecture 48 - P-completeness and NEXP-completeness

1x
Search within video (e.g: "algorithm", "compiler" or "coding theory")

                       

Speech Recogniser Status: Not Recognising


    /
        


    DIGIMAT Learning Management Platform