A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances

2008/05/06 by Magnus Wahlström · 2 citations
Computer Science · Decision Sciences · Mathematics · #Algorithm #Bayesian Modeling and Causal Inference #Computer science #Data mining #Discrete mathematics #Extension (predicate logic) #Formal Methods in Verification #Geometry #Mathematical analysis #Mathematics #Measure (data warehouse) #Multivariate statistics #Piecewise #Piecewise linear function #Programming language #Simulation Techniques and Applications #Statistics #Upper and lower bounds

paper · doi:10.1007/978-3-540-79723-4_19

openalex publication_date 2008/05/06 · crossref created 2008/05/06 · crossref deposited 2020/11/24 · openalex created_date 2025/10/10 · crossref indexed 2026/01/12 · openalex updated_date 2026/08/04

Citations

• The Design and Analysis of Algorithms
• The complexity of computing the permanent
• The Complexity of Enumeration and Reliability Problems
• Counting models for 2SAT and 3SAT formulae

Cited by

• Exact algorithms for maximum independent set
• 2-satisfiability [wikipedia]