A two-phase algorithm for solving a class of hard satisfiability problems
From MaRDI portal
Publication:1306378
DOI10.1016/S0167-6377(98)00052-2zbMATH Open0960.90100MaRDI QIDQ1306378FDOQ1306378
Hans van Maaren, Joost P. Warners
Publication date: 20 May 2001
Published in: Operations Research Letters (Search for Journal in Brave)
Recommendations
- [[:Publication:4375756|Title not available (Why is that?)]]
- [[:Publication:5687266|Title not available (Why is that?)]]
- A dual algorithm for the satisfiability problem
- Generating hard satisfiability problems
Cites Work
- A new polynomial-time algorithm for linear programming
- The complexity of satisfiability problems
- The complexity of theorem-proving procedures
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Principles and Practice of Constraint Programming – CP 2003
- Recognition of tractable satisfiability problems through balanced polynomial representations
- Title not available (Why is that?)
Cited In (10)
- The state of SAT
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Equivalent literal propagation in the DLL procedure
- An improved semidefinite programming relaxation for the satisfiability problem
- Filter-based resolution principle for lattice-valued propositional logic LP\((X)\)
- Exploiting the real power of unit propagation lookahead
- How to fake an RSA signature by encoding modular root finding as a SAT problem
- Recognition of tractable satisfiability problems through balanced polynomial representations
- Non-clausal redundancy properties
- Equivalency reasoning to solve a class of hard SAT problems.
Uses Software
This page was built for publication: A two-phase algorithm for solving a class of hard satisfiability problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306378)
