An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs-Reference-Cited by-同舟云学术

An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs

Published:2007-01-30 Issue:1-2 Volume:48 Page:1-14
ISSN:1012-2443
Container-title:Annals of Mathematics and Artificial Intelligence
language:en
Short-container-title:Ann Math Artif Intell

Author:

Anjos Miguel F.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Artificial Intelligence

Link

http://link.springer.com/content/pdf/10.1007/s10472-006-9041-2.pdf

Reference34 articles.

1. Anjos, M.F.: New convex relaxations for the maximum cut and VLSI layout problems. Ph.D. thesis, University of Waterloo. Published online at http://etd.uwaterloo.ca/etd/manjos2001.pdf (2001)

2. Anjos, M.F.: On semidefinite programming relaxations for the satisfiability problem. Math. Methods Oper. Res. 60(3) (2004)

3. Anjos, M.F.: Proofs of unsatisfiability via semidefinite programming. In: Operations Research Proceedings 2003, pp. 308–315. Springer, Berlin Heidelberg New York (2004)

4. Anjos, M.F.: An improved semidefinite programming relaxation for the satisfiability problem. Math. Program. 102(3), 589–608 (2005)

5. Anjos, M.F., Wolkowicz, H.: Geometry of semidefinite max-cut relaxations via matrix ranks. J. Comb. Optim. 6(3), 237–270 (2002)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Chapter 1. A History of Satisfiability;Frontiers in Artificial Intelligence and Applications;2021-02-02

2. On semidefinite least squares and minimal unsatisfiability;Discrete Applied Mathematics;2017-01

3. Semidefinite resolution and exactness of semidefinite relaxations for satisfiability;Discrete Applied Mathematics;2013-12