Relaxations of the satisfiability problem using semidefinite programming
From MaRDI portal
Publication:1977751
DOI10.1023/A:1006362203438zbMath0965.03017OpenAlexW1562502650MaRDI QIDQ1977751
Hans van Maaren, Joost P. Warners, Etienne de Klerk
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
Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Mechanization of proofs and logical operations (03B35)
Related Items (5)
An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs ⋮ Semidefinite resolution and exactness of semidefinite relaxations for satisfiability ⋮ On semidefinite least squares and minimal unsatisfiability ⋮ Semidefinite Programming and Constraint Programming ⋮ Generalising unit-refutation completeness and SLUR via nested input resolution
Uses Software
This page was built for publication: Relaxations of the satisfiability problem using semidefinite programming
