On the counting version of the maximum 2-satisfiability problem
From MaRDI portal
Cites work
- A new exact solver for (Weighted) Max\#SAT
- Almost every 2-SAT function is unate
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- Certified Core-Guided MaxSAT Solving
- CHAMP: a multipass algorithm for Max Sat based on saver variables
- Computational Complexity
- scientific article; zbMATH DE number 3628385 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2004
- MaxSAT resolution and subcube sums
- On approximating minimum vertex cover for graphs with perfect matching
- On the power of counting the total number of computation paths of NPTMs
- On unique graph 3-colorability and parsimonious reductions in the plane
- Random MAX SAT, random MAX CUT, and their phase transitions
- Reducibility among combinatorial problems
- Revisiting maximum satisfiability and related problems in data streams
- Some simplified NP-complete graph problems
- The complexity of computing the permanent
- Tight approximability of MAX 2-SAT and relatives, under UGC
This page was built for publication: On the counting version of the maximum 2-satisfiability problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6879523)
