Adam Teodor Polak

EPFL SB MATH DISOPT
MA C1 563 (Bâtiment MA)
Station 8
CH-1015 Lausanne

Web site: Web site: https://disopt.epfl.ch/

EPFL SB MATH DISOPT
MA C1 563 (Bâtiment MA)
Station 8
CH-1015 Lausanne

vCard
Administrative data

Teaching & PhD

Courses

Fine-grained and parameterized complexity

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.