Ján Pich

Department of Computer Science
University of Oxford
jan.pich@cs.ox.ac.uk

I am a Marie Curie research fellow at the Algorithms and Complexity Theory Group.

Research interests: Mathematical Logic and Complexity Theory. In particular, Proof Complexity.

CV       RS         Krajicek fest       Complexity Theory workshop       For students       Media

Recent popularizing articles:

'How hard is it to separate P and NP?'
  An article on my work on the unprovability of strong complexity separations, to appear in link1 link, Oxford, June 2021.

'Lower bounds in computational complexity' by Rahul Santhanam
  An article on my work on hardness magnification. Alumni: Igor Barilik; Simons Institute, Berkeley, 2019.

(back to front page)

Poetry collection: Mathesis universalis, Literis 2016.