activity
20142024
most citedLogical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic

42 citations · 46 across the 4 of their papers we have counts for

collaborators
Showing 2014 · math.LOShow all

1 paper · 2 filters

math.LO2014★ 42 cited

Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic

Ján Pich

We present several known formalizations of theorems from computational complexity in bounded arithmetic and formalize the PCP theorem in the theory PV1 (no formalization of this th…