A new PCP outer verifier with applications to homogeneous linear equations and max-bisection

DOI10.1145/1007352.1007362zbMath1192.68324MaRDI QIDQ3580955

Subhash A. Khot, Jonas Holmerin

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1007352.1007362

Mathematics Subject Classification ID

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

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

Related Items

On the hardness of learning intersections of two halfspaces