Jakub Opršal
Dr Jakub Opršal
Research Associate
E: jakub.oprsal@cs.ox.ac.uk
Wolfson Building, Parks Road, Oxford OX1 3QD
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, and I use deep mathematical theories, including universal algebra, topology, and topological combinatorics for this goal.