NPTEL Video Course : ACM Summer School on Graph Theory and Graph Algorithms (Dr. N.S. Narayanaswamy)
Lecture 32 - Hardness in Parameterized Complexity - W - hard reductions Exponential algorithms - Part 1
Home
Previous
Next
Thumbnails