The following pages link to MAX-2-SAT (Q15887):
Displaying 40 items.
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) (← links)
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
- Improving exact algorithms for MAX-2-SAT (Q812398) (← links)
- The power of quantum systems on a line (Q842451) (← links)
- Optimal 2-constraint satisfaction via sum-product algorithms (Q844150) (← links)
- An upper (lower) bound for Max (Min) CSP (Q893727) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- Sums of squares based approximation algorithms for MAX-SAT (Q944728) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- Worst-case study of local search for MAX-\(k\)-SAT. (Q1408379) (← links)
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case? (Q1779533) (← links)
- A tighter upper bound for random MAX \(2\)-SAT (Q1944049) (← links)
- Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
- Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
- New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
- A \(2^{|E|/4}\)-time algorithm for MAX-CUT (Q2577592) (← links)
- A new algorithm for optimal 2-constraint satisfaction and its implications (Q2581276) (← links)
- (Q2701740) (← links)
- Satisfiability with Index Dependency (Q3060720) (← links)
- Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time (Q3373669) (← links)
- (Q3429015) (← links)
- An Empirical Study of MAX-2-SAT Phase Transitions (Q3439118) (← links)
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem (Q3452557) (← links)
- New Bounds for MAX-SAT by Clause Learning (Q3499776) (← links)
- A new approach to proving upper bounds for MAX-2-SAT (Q3581524) (← links)
- A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach (Q3599157) (← links)
- Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem (Q3639279) (← links)
- New Upper Bounds for Maximum Satisfiability (Q4500858) (← links)
- (Q4550772) (← links)
- On the Lower Bounds of Random Max 3 and 4-SAT (Q4632196) (← links)
- Exact Algorithms for MAX-SAT (Q4916231) (← links)
- An LP-Designed Algorithm for Constraint Satisfaction (Q5449561) (← links)
- Automata, Languages and Programming (Q5466451) (← links)
- Theory and Applications of Satisfiability Testing (Q5713720) (← links)
- Algorithms - ESA 2003 (Q5897255) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897572) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5898782) (← links)
