MAX-2-SAT

swMATH3355MaRDI QIDQ15887

No author found.

Related Items (40)

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

This page was built for software: MAX-2-SAT