Fortnow, Lance; Santhanam, Rahul Infeasibility of instance compression and succinct PCPs for NP. (English) Zbl 1231.68133 STOC’08. Proceedings of the 40th annual ACM symposium on theory of computing 2008, Victoria, Canada, May 17–20, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-047-0). 133-142 (2008). For the entire collection see [Zbl 1147.68001]. Cited in 12 ReviewsCited in 32 Documents MSC: 68Q15 Complexity classes (hierarchies, relations among complexity classes, etc.) PDF BibTeX XML Cite \textit{L. Fortnow} and \textit{R. Santhanam}, in: Proceedings of the 40th annual ACM symposium on theory of computing, STOC 2008. Victoria, Canada, May 17--20, 2008. New York, NY: Association for Computing Machinery (ACM). 133--142 (2008; Zbl 1231.68133)