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

I work in computational complexity almost exclusively on problems inside the class NP, so-called constraint satisfaction problems. Currently, we are investigating reductions between promise versions of constraint satisfaction; in such promise problems, one is given an instance that is promise to have a solution satisfying some strong constraints (e.g., a graph that is 3 colourable), and is asked to provide a solution satisfying weaker constraints (e.g., colour the graph with 6 colours).

The complexity of such problems depends on surprisingly abstract properties of the problems, and require deep mathematical theories: universal algebra, homology theory, topological combinatorics, and many that we are not yet completely aware of.

Brief CV