Solving satisfiability problems using elliptic approximations -- effective branching rules
From MaRDI portal
Publication:1841892
DOI10.1016/S0166-218X(00)00249-3zbMath0965.68026MaRDI QIDQ1841892
Joost P. Warners, Hans van Maaren
Publication date: 29 July 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (5)
Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets ⋮ Recognition of tractable satisfiability problems through balanced polynomial representations ⋮ A SAT approach to query optimization in mediator systems ⋮ Investigations on autark assignments ⋮ A short note on some tractable cases of the satisfiability problem.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational experience with an interior point algorithm on the satisfiability problem
- Solving propositional satisfiability problems
- A potential reduction approach to the frequency assignment problem
- A fast parallel SAT-solver -- efficient workload balancing
- Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT
- Solving satisfiability problems using elliptic approximations. A note on volumes and weights
- Branching rules for satisfiability
- Elliptic approximations of propositional formulae
- Recognition of tractable satisfiability problems through balanced polynomial representations
- A nonlinear approach to a class of combinatorial optimization problems
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- The complexity of theorem-proving procedures
This page was built for publication: Solving satisfiability problems using elliptic approximations -- effective branching rules
