Infeasibility of instance compression and succinct PCPs for NP

DOI10.1016/j.jcss.2010.06.007zbMath1233.68144MaRDI QIDQ619903

Rahul Santhanam, Lance J. Fortnow

Publication date: 18 January 2011

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2010.06.007

zbMATH Keywords

satisfiability problem; compressibility; parameterized complexity; probabilistically checkable proof

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)