Course

MATH-683: Fine-grained and parameterized complexity

Summary

The classical distinction between polynomial time solvable and NP-hard problems is often too coarse. This course covers techniques for proving more fine-grained lower and upper bounds on complexity of computational problems.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Instructors

Loading

Lectures in this course

Loading

Related concepts

Loading

Related courses

Loading