Counting All Solutions of Minimum Weight Exact Satisfiability

DOI10.1007/11758471_8MaRDI QIDQ3434542zbMATH OpenOpenAlexFDO

Authors Stefan Porschen

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758471_8

zbMATH Keywords

counting problemmaximum weight independent setminimum weight exact satisfiabilityminimum weight set partition

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On variable-weighted exact satisfiability problems
• Algorithms and Computation
• SOFSEM 2005: Theory and Practice of Computer Science
• New algorithms for exact satisfiability
• New worst-case upper bound for counting exact satisfiability

Cited in

(5)

• On variable-weighted exact satisfiability problems
• SOFSEM 2005: Theory and Practice of Computer Science
• The weight in enumeration
• Algorithms and Computation
• Estimating satisfiability

This page was built for publication: Counting All Solutions of Minimum Weight Exact Satisfiability

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