Skip to main content
University of Oxford Department of Computer Science
Search for
Search
Toggle
Main Menu
Home
Admissions
Research
(current)
News & Events
About Us
Alumni
Our Students
Innovation
Home
Research
Publications
Infeasibility of Instance Compression and Succinct PCPs for NP
Infeasibility of Instance Compression and Succinct PCPs for NP
Rahul Santhanam and Lance Fortnow
Journal
Proceedings of the 40th Annual ACM Symposium on Theory of Computing
Year
2008
Links
BibTeX
See Also
Rahul Santhanam
Algorithms and Complexity Theory
Artificial Intelligence and Machine Learning
Automated Verification
Computational Biology and Health Informatics
Cyber Physical Systems
Data and Knowledge
Foundations, Structures, and Quantum
Human Centered Computing
Programming Languages
Security
Back to Top