Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting

DOI10.3233/FI-2015-1159zbMath1337.68127OpenAlexW1767868015MaRDI QIDQ2805407

Nadia Creignou, Heribert Vollmer

Publication date: 11 May 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2015-1159

zbMATH Keywords

Boolean functionparametrized complexityBoolean circuitweighted satisfiabilityPost latticeparametrized counting complexitypolynomial-delay enumeration

Mathematics Subject Classification ID

Related Items (4)

Enumerating teams in first-order team logics ⋮ Succinct certification of monotone circuits ⋮ Succinct monotone circuit certification: planarity and parameterized complexity ⋮ A complexity theory for hard enumeration problems

This page was built for publication: Parameterized Complexity of Weighted Satisfiability Problems: Decision, Enumeration, Counting