scientific article; zbMATH DE number 1500507
From MaRDI portal
Publication:4501522
Recommendations
Cited in
(24)- Worst-case study of local search for MAX-\(k\)-SAT.
- Improved exact algorithms for mildly sparse instances of MAX SAT
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP
- Improving exact algorithms for MAX-2-SAT
- Almost 2-SAT is fixed-parameter tractable
- An Empirical Study of MAX-2-SAT Phase Transitions
- A tighter upper bound for random MAX \(2\)-SAT
- An enumerative algorithm for \#2SAT
- Solving sparse instances of Max SAT via width reduction and greedy restriction
- A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
- A new upper bound for Max-2-SAT: A graph-theoretic approach
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between
- MAX-2-SAT
- Exact algorithms for MAX-SAT
- New upper bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the average variable degree
- Linear-programming design and analysis of fast algorithms for Max 2-CSP
- On the Lower Bounds of Random Max 3 and 4-SAT
- A Spectral Method for MAX2SAT in the Planted Solution Model
- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
- An upper (lower) bound for Max (Min) CSP
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- New exact algorithms for the 2-constraint satisfaction problem
- On the lower bounds of random Max 3 and 4-SAT
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501522)
