about me

Mathematicians think I am a computer scientist, computer scientists think I am a mathematician. And I think I am a barber.

research interests

My work lies at the interface of mathematics and computer science. I am seeking to answer what inherent mathematical quality makes a computational problem hard, and which allows us to design an efficient algorithm to solve this problem. In essence, we are asking if P ≠ NP, how can we distinguish problems that are in P from those that are NP-complete?

To answer these questions, I investigate the complexity of constraint satisfaction problems and its variants including approximation. To study those I use deep mathematical theories, including topology, topological combinatorics, and universal algebra.

accademic positions and long-term visits


teaching experience

invited presentations

academic service