A new PCP outer verifier with applications to homogeneous linear equations and max-bisection
From MaRDI portal
Publication:3580955
DOI10.1145/1007352.1007362zbMath1192.68324MaRDI QIDQ3580955
Jonas Holmerin, Subhash A. Khot
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
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Unnamed Item, Complexity of approximating CSP with balance/hard constraints, Improved approximation algorithms for projection games, On the hardness of learning intersections of two halfspaces, Complexity and approximation of finding the longest vector sum