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

Spines of random constraint satisfaction problems: definition and connection with computational complexity

By Istrate Gabriel   Boettcher Stefan   Percus Allon  

Annals of Mathematics and Artificial Intelligence, Vol. 44, Iss. 4, 2005-08 ,pp. : 353-372

Springer Publishing Company

Access to resources Recommend Favorite

Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems

By Kullmann Oliver  

Annals of Mathematics and Artificial Intelligence, Vol. 40, Iss. 3-4, 2004-03 ,pp. : 303-352

Springer Publishing Company

Access to resources Recommend Favorite

Approximation of Boolean Functions by Local Search

By Albrecht Andreas   Wong Chak-Kuen  

Computational Optimization and Applications, Vol. 27, Iss. 1, 2004-01 ,pp. : 53-82

Springer Publishing Company

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