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

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.48, Iss.1-2, 2006-09, pp. : 1-14

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Bounds for the 2-domination number of toroidal grid graphs

By Shaheen Ramy

International Journal of Computer Mathematics, Vol. 86, Iss. 4, 2009-04 ,pp. : 584-588

Taylor & Francis Ltd

Access to resources Recommend Favorite

On semidefinite programming relaxations for the satisfiability problem

By Anjos Miguel F.

Mathematical Methods of Operations Research, Vol. 60, Iss. 3, 2004-12 ,pp. : 349-367

Springer Publishing Company

Access to resources Recommend Favorite

A new library of structured semidefinite programming instances

By de Klerk Etienne Sotirov Renata

Optimization Methods and Software, Vol. 24, Iss. 6, 2009-12 ,pp. : 959-971

Taylor & Francis Ltd

Access to resources Recommend Favorite

On longest cycles in grid graphs

By Menke B.

Studia Scientiarum Mathematicarum Hungarica, Vol. 36, Iss. 1-2, 2000-12 ,pp. : 201-230

Akademiai Kiado

Access to resources Recommend Favorite

Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances

By Maaren Hans

Annals of Mathematics and Artificial Intelligence, Vol. 44, Iss. 1-2, 2005-05 ,pp. : 157-177

Springer Publishing Company

Access to resources Recommend Favorite