A new bound for 3-satisfiable MaxSat and its algorithmic application
From MaRDI portal
(Redirected from Publication:393085)
Recommendations
Cites work
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A new bound for 3-satisfiable MaxSat and its algorithmic application
- Complexity of Partial Satisfaction
- Implications of forbidden structures for extremal algorithmic problems
- Improved parameterized algorithms for above average constraint satisfaction
- Kernels: Annotated, Proper and Induced
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
- Locally satisfiable formulas
- Lower bounds for kernelizations and other preprocessing procedures
- Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
- Note on Max Lin-2 above average
- On Local Versus Global Satisfiability
- On the Approximation of Maximum Satisfiability
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Parametrized complexity theory.
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
- Solving MAX-\(r\)-SAT above a tight lower bound
- Solving satisfiability in less than \(2^ n\) steps
- Systems of linear equations over \(\mathbb{F}_2\) and problems parameterized above average
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(12)- A new bound for 3-satisfiable MaxSat and its algorithmic application
- New methods for 3-SAT decision and worst-case analysis
- scientific article; zbMATH DE number 1113996 (Why is no real title available?)
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- Conditional Hardness of Approximating Satisfiable Max 3CSP-q
- The Approximability of Three-valued MAX CSP
- A new algorithm for parameterized MAX-SAT
- On the parallel parameterized complexity of MaxSAT variants
- Improved fixed-parameter algorithm for the minimum weight 3-SAT problem
- A dichotomy theorem for constraint satisfaction problems on a 3-element set
- Parameterized constraint satisfaction problems: a survey
- Upper and lower bounds for different parameterizations of \((n,3)\)-MAXSAT
This page was built for publication: A new bound for 3-satisfiable MaxSat and its algorithmic application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393085)
