Approximate constraint satisfaction requires large LP relaxations

DOI10.1109/FOCS.2013.45MaRDI QIDQ6981740zbMATH OpenFDO

Authors Siu On Chan, James R. Lee, David Steurer, Prasad Raghavendra

Publication date 20 May 2025

Full work available at URL https://doi.org/10.1109/FOCS.2013.45

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(1)

• The Sherali-Adams and Weisfeiler-Leman hierarchies in (promise valued) constraint satisfaction problems

This page was built for publication: Approximate constraint satisfaction requires large LP relaxations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981740)