Proofs of unsatisfiability via semidefinite programming
From MaRDI portal
Recommendations
- On an unsatisfiability-satisfiability prover
- On semidefinite programming relaxations for the satisfiability problem
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
- Relaxations of the satisfiability problem using semidefinite programming
- Relaxations of the satisfiability problem using semidefinite programming
- An extended semidefinite relaxation for satisfiability
- On good algorithms for determining unsatisfiability of propositional formulas
- On the complexity of semidefinite programs
- Practical algorithms for unsatisfiability proof and core generation in SAT solvers
Cited in
(8)- An improved semidefinite programming relaxation for the satisfiability problem
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs
- Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems
- Practical algorithms for unsatisfiability proof and core generation in SAT solvers
- scientific article; zbMATH DE number 1336257 (Why is no real title available?)
- On semidefinite least squares and minimal unsatisfiability
- Sums of squares, satisfiability and maximum satisfiability
This page was built for publication: Proofs of unsatisfiability via semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4667097)