01
Algorithms and complexity
Design and analysis of provably efficient algorithms, with attention to the structural boundary between tractable and intractable problems.
- Which structural restrictions turn an intractable problem into a tractable one?
- When can enumeration be performed with polynomial delay or incremental efficiency?
- Which lower bounds explain the limit of an algorithmic approach?
- How should theoretical guarantees guide practical implementation?