MAX-2-SAT
From MaRDI portal
Software:15887
swMATH3355MaRDI QIDQ15887FDOQ15887
Author name not available (Why is that?)
Cited In (40)
- Sums of squares based approximation algorithms for MAX-SAT
- Satisfiability with Index Dependency
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- Exact Algorithms for MAX-SAT
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between
- Title not available (Why is that?)
- Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem
- New exact algorithms for the 2-constraint satisfaction problem
- Worst-case study of local search for MAX-\(k\)-SAT.
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
- Improving exact algorithms for MAX-2-SAT
- Optimal 2-constraint satisfaction via sum-product algorithms
- On the Lower Bounds of Random Max 3 and 4-SAT
- Automata, Languages and Programming
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
- A new upper bound for Max-2-SAT: A graph-theoretic approach
- Algorithms - ESA 2003
- Solving sparse instances of Max SAT via width reduction and greedy restriction
- Linear-programming design and analysis of fast algorithms for Max 2-CSP
- An upper (lower) bound for Max (Min) CSP
- A new algorithm for optimal 2-constraint satisfaction and its implications
- An Empirical Study of MAX-2-SAT Phase Transitions
- Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
- Graph-Theoretic Concepts in Computer Science
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case?
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP
- Title not available (Why is that?)
- A tighter upper bound for random MAX \(2\)-SAT
- The power of quantum systems on a line
- New Bounds for MAX-SAT by Clause Learning
- A new approach to proving upper bounds for MAX-2-SAT
- A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
- Theory and Applications of Satisfiability Testing
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- A \(2^{|E|/4}\)-time algorithm for MAX-CUT
- Improved exact algorithms for mildly sparse instances of MAX SAT
- Title not available (Why is that?)
- New Upper Bounds for Maximum Satisfiability
- An LP-Designed Algorithm for Constraint Satisfaction
This page was built for software: MAX-2-SAT