Parameterized Complexity of Weighted Satisfiability Problems
From MaRDI portal
Publication:2843338
DOI10.1007/978-3-642-31612-8_26zbMath1273.68160OpenAlexW2156117182MaRDI QIDQ2843338
Heribert Vollmer, Nadia Creignou
Publication date: 12 August 2013
Published in: Theory and Applications of Satisfiability Testing – SAT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31612-8_26
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: Parameterized Complexity of Weighted Satisfiability Problems
