When is weighted satisfiability FPT?

DOI10.1007/978-3-642-40104-6_39MaRDI QIDQ2842181zbMATH OpenOpenAlexFDO

Authors Ge Xia, Iyad Kanj

Publication date 12 August 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-40104-6_39

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability
• Parameterized complexity of weighted satisfiability problems
• Parameterized complexity of weighted satisfiability problems: decision, enumeration, counting
• Completely inapproximable monotone and antimonotone parameterized problems
• SOFSEM 2005: Theory and Practice of Computer Science

Cited in

(4)

• On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability
• Completely inapproximable monotone and antimonotone parameterized problems
• Parameterized complexity of weighted satisfiability problems: decision, enumeration, counting
• Parameterized complexity of weighted satisfiability problems

This page was built for publication: When is weighted satisfiability FPT?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842181)