Towards a Characterization of Approximation Resistance for Symmetric CSPs

From MaRDI portal

Revision as of 00:04, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5351908

Jump to:navigation, search

DOI10.4230/LIPIcs.APPROX-RANDOM.2015.305zbMath1375.68103OpenAlexW2285292888MaRDI QIDQ5351908

Euiwoong Lee, Venkatesan Guruswami

Publication date: 31 August 2017

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/5309/pdf/19.pdf/

zbMATH Keywords

constraint satisfaction problems approximation resistance

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Related Items (1)

Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph

This page was built for publication: Towards a Characterization of Approximation Resistance for Symmetric CSPs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5351908&oldid=20057355"