The Complexity of Somewhat Approximation Resistant Predicates

DOI10.1007/978-3-662-43948-7_57zbMath1412.68086OpenAlexW226747779MaRDI QIDQ5167783

Madhur Tulsiani, Pratik Worah, Subhash A. Khot

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43948-7_57

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

This page was built for publication: The Complexity of Somewhat Approximation Resistant Predicates