A new tractable class of constraint satisfaction problems

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.44, Iss.1-2, 2005-05, pp. : 61-85

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

A new approach to partial constraint satisfaction problems

By D. K. Gupta N. Gupta

International Journal of Computer Mathematics, Vol. 81, Iss. 12, 2004-12 ,pp. : 1465-1476

Taylor & Francis Ltd

Access to resources Recommend Favorite

STCSP – structured temporal constraint satisfaction problems

By Balaban M.

Annals of Mathematics and Artificial Intelligence, Vol. 25, Iss. 1-2, 1999-01 ,pp. : 35-67

Springer Publishing Company

Access to resources Recommend Favorite

The complexity of Boolean constraint satisfaction local search problems

By Chapdelaine Philippe

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1, 2005-01 ,pp. : 51-63

Springer Publishing Company

Access to resources Recommend Favorite

An Average Analysis of Backtracking on Random Constraint Satisfaction Problems

By Xu K.

Annals of Mathematics and Artificial Intelligence, Vol. 33, Iss. 1, 2001-09 ,pp. : 21-37

Springer Publishing Company

Access to resources Recommend Favorite

The Complexity of Boolean Constraint Satisfaction Local Search Problems

By Chapdelaine Philippe

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1-4, 2005-01 ,pp. : 51-63

Springer Publishing Company

Access to resources Recommend Favorite