Area: Mathematical Logic & Complexity Theory

Publications (2009-2014):

Complexity theory in feasible mathematics, PhD thesis, 2014.

Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic, LMCS'15, preprint: Jun 2014.

A PV-proof of the PCP theorem.

Circuit lower bounds in bounded arithmetics, APAL'15, preprint: May 2013.

Theories weaker than PV cannot prove polynomial circuit lower bounds for SAT unless p-size circuits are approximable by weaker computational models.

Hard tautologies, MSc thesis, 2011.

Nisan-Wigderson generators in proof systems with forms of interpolation, MLQ'11, preprint: Mar 2010.

This shows that Razborov's conjecture about NW-generators holds for systems admitting feasible interpolation.

Bounded arithmetic and theory of Razborov and Rudich, Bc thesis, 2009.

+ publications from 2015-present

+ blog (2008-2010)   + poetry (2012)   + mathesis universalis (print, preprint)