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

- Ján Pich
- Logical Methods in Computer Science
- 2014

@inproceedings{Buss2017ExpanderCI, title={Expander Construction in VNC}, author={Sam Buss and Valentine Kabanets and Antonina Kolokolova and Michal Kouck{\'y}}, year={2017} }

- Published 2017

We give a combinatorial analysis (using edge expansion) of a variant of the iterative expander construction due to Reingold, Vadhan, and Wigderson [RVW02], and show that this analysis can be formalized in the bounded-arithmetic system VNC (corresponding to the “NC reasoning”). As a corollary, we prove the assumption made by Jeřábek [Jeř11b] that a… CONTINUE READING

### Presentations referencing similar topics