A two-phase algorithm for solving a class of hard satisfiability problems
From MaRDI portal
(Redirected from Publication:1306378)
Recommendations
Cites work
- scientific article; zbMATH DE number 956868 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- A new polynomial-time algorithm for linear programming
- Recognition of tractable satisfiability problems through balanced polynomial representations
- Ten challenges \textit{redux}: recent progress in propositional reasoning and search
- The complexity of satisfiability problems
- The complexity of theorem-proving procedures
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.
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)
