Max-Sur-CSP on Two Elements
From MaRDI portal
Publication:4899300
DOI10.1007/978-3-642-33558-7_6zbMath1440.68133OpenAlexW2100091010MaRDI QIDQ4899300
Publication date: 8 January 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33558-7_6
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
The Complexity of Boolean Surjective General-Valued CSPs ⋮ An algebraic hardness criterion for surjective constraint satisfaction.
This page was built for publication: Max-Sur-CSP on Two Elements
