New upper bounds for the problem of maximal satisfiability
From MaRDI portal
Publication:3225865
Recommendations
- New Upper Bounds for Maximum Satisfiability
- Publication:4938646
- scientific article; zbMATH DE number 1522934
- Upper bounds on the satisfiability threshold
- A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
- A new upper bound for Max-2-SAT: A graph-theoretic approach
- New worst-case upper bound for counting exact satisfiability
Cites work
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Algorithms for maximum independent sets
- Linear-programming design and analysis of fast algorithms for Max 2-CSP
- MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time
- New Bounds for MAX-SAT by Clause Learning
- New methods for 3-SAT decision and worst-case analysis
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
Cited in
(12)- Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment
- scientific article; zbMATH DE number 7310227 (Why is no real title available?)
- A tighter upper bound for random MAX \(2\)-SAT
- A new upper bound for Max-2-SAT: A graph-theoretic approach
- New upper bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the average variable degree
- Achieving new upper bounds for the hypergraph duality problem through logic
- scientific article; zbMATH DE number 6297727 (Why is no real title available?)
- New Upper Bounds for Maximum Satisfiability
- New Bounds for MAX-SAT by Clause Learning
- Solving SCS for bounded length strings in fewer than \(2^n\) steps
- New exact algorithms for the 2-constraint satisfaction problem
- From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes
This page was built for publication: New upper bounds for the problem of maximal satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225865)
