Research
Algorithms and Complexity
Theory Lab
What makes a computational problem hard? This is the guiding question in our laboratory. We design efficient algorithms for computational problems and prove lower bounds on their complexity in various computational models and under various assumptions.
Areas of research include exact and approximate algorithms for NP-hard problems, fine-grained complexity, and circuit complexity.