Fixed-parameter Approximability of Boolean MinCSPs
From MaRDI portal
Publication:4606287
DOI10.4230/LIPIcs.ESA.2016.18zbMath1397.68090arXiv1601.04935OpenAlexW2962826665MaRDI QIDQ4606287
Édouard Bonnet, László Egri, Dániel Marx
Publication date: 2 March 2018
Full work available at URL: https://arxiv.org/abs/1601.04935
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
The Complexity of Valued CSPs ⋮ Matrix Rigidity from the Viewpoint of Parameterized Complexity ⋮ Unnamed Item ⋮ Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction
This page was built for publication: Fixed-parameter Approximability of Boolean MinCSPs
