Relaxations of the satisfiability problem using semidefinite programming
From MaRDI portal
Publication:1977751
DOI10.1023/A:1006362203438zbMATH Open0965.03017OpenAlexW1562502650MaRDI QIDQ1977751FDOQ1977751
Hans van Maaren, E. de Klerk, Joost P. Warners
Publication date: 26 July 2001
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1006362203438
Recommendations
- Relaxations of the satisfiability problem using semidefinite programming
- On semidefinite programming relaxations for the satisfiability problem
- An improved semidefinite programming relaxation for the satisfiability problem
- An extended semidefinite relaxation for satisfiability
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
- Exploiting semidefinite relaxations in constraint programming
- On semidefinite programming relaxations of \((2+p)\)-SAT
- Semidefinite programming relaxations for semialgebraic problems
- Semidefinite relaxations for integer programming
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Mechanization of proofs and logical operations (03B35)
Cited In (14)
- An extended semidefinite relaxation for satisfiability
- An improved semidefinite programming relaxation for the satisfiability problem
- On semidefinite programming relaxations of \((2+p)\)-SAT
- On semidefinite programming relaxations for the satisfiability problem
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
- Semidefinite relaxations of dynamical programs under discrete constraints
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs
- Generalising unit-refutation completeness and SLUR via nested input resolution
- Title not available (Why is that?)
- Relaxations of the satisfiability problem using semidefinite programming
- Exploiting semidefinite relaxations in constraint programming
- Title not available (Why is that?)
- Semidefinite Programming and Constraint Programming
- On semidefinite least squares and minimal unsatisfiability
Uses Software
This page was built for publication: Relaxations of the satisfiability problem using semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1977751)
