APA (7th ed.) Citation
(2015). Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic. Logical Methods in Computer Science.
Chicago Style (17th ed.) Citation
"Logical Strength of Complexity Theory and a Formalization of the PCP Theorem in Bounded Arithmetic." Logical Methods in Computer Science 2015.
MLA (9th ed.) Citation
"Logical Strength of Complexity Theory and a Formalization of the PCP Theorem in Bounded Arithmetic." Logical Methods in Computer Science, 2015.
Warning: These citations may not always be 100% accurate.