A fast algorithm for maximum satisfiability above half number of clauses
From MaRDI portal
Cites work
- A new algorithm for parameterized MAX-SAT
- A new bound for 3-satisfiable MaxSat and its algorithmic application
- A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm
- Exact algorithms for dominating set
- Exact exponential algorithms.
- Faster parameterized algorithms using linear programming
- Finding detours is fixed-parameter tractable
- Fixed-parameter tractability of satisfying beyond the number of variables
- Further improvements for SAT in terms of formula length
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1522934 (Why is no real title available?)
- Improved exact algorithms for MAX-SAT
- Improved parameterized algorithms for above average constraint satisfaction
- Multiplicative Parameterization Above a Guarantee
- On multiway cut parameterized above lower bounds
- On the complexity of k-SAT
- Parameterized constraint satisfaction problems: a survey
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Parameterizing above or below guaranteed values
- Polynomial kernels for -extendible properties parameterized above the Poljak-Turzík bound
- Raising the bar for \textsc{Vertex Cover}: fixed-parameter tractability above a higher guarantee
- Solving MAX-\(r\)-SAT above a tight lower bound
- The complexity of satisfiability problems
- The complexity of theorem-proving procedures
This page was built for publication: A fast algorithm for maximum satisfiability above half number of clauses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288087)
