Relaxations of the satisfiability problem using semidefinite programming
From MaRDI portal
Publication:1977751
DOI10.1023/A:1006362203438zbMath0965.03017MaRDI QIDQ1977751
Etienne de Klerk, Hans van Maaren, Joost P. Warners
Publication date: 26 July 2001
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
90C22: Semidefinite programming
03B35: Mechanization of proofs and logical operations
Related Items
Semidefinite resolution and exactness of semidefinite relaxations for satisfiability, An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs
Uses Software