On Quadratic Threshold CSPs
From MaRDI portal
Publication:3557031
DOI10.1007/978-3-642-12200-2_30zbMath1283.68159OpenAlexW1523797563MaRDI QIDQ3557031
Per Austrin, Siavosh Benabbas, Avner Magen
Publication date: 27 April 2010
Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12200-2_30
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items