Ján Pich
Department of Computer Science
University of Oxford
jan.pich@cs.ox.ac.uk
Royal Society University Research Fellow
Area: Mathematical Logic & Complexity Theory
CV       Research Statement       Papers
URF Project:
My research is supported by the Royal Society University Research Fellowship
under the project "Proof Complexity and Circuit Complexity: a Unified Approach."
Research Team:
Erfan Khaniki (postdoc, from June 2024) - Awarded Sacks Prize in Feb 2025
Bruno Cavalar (postdoc, July 2024 - July 2025) - Resolved the monotone complexity of matching in Jul 2025
- Works with R.Santhanam (Oxford) since Aug 2025
Undergraduates:
If you are interested in a summer internship on logic and complexity, contact me.