On the Hamming distance of constraint satisfaction problems

Author： Crescenzi P.   Rossi G.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.288, Iss.1, 2002-10, pp. : 85-100

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

Periodic Constraint Satisfaction Problems: Tractable Subclasses

By Chen Hubie  

Constraints, Vol. 10, Iss. 2, 2005-04 ,pp. : 97-113

Springer Publishing Company

Access to resources Recommend Favorite

Solution Techniques for Constraint Satisfaction Problems: Foundations

By Miguel I.   Shen Q.  

Artificial Intelligence Review, Vol. 15, Iss. 4, 2001-06 ,pp. : 243-267

Springer Publishing Company

Access to resources Recommend Favorite

Conditional lexicographic orders in constraint satisfaction problems

By Wallace Richard  

Annals of Operations Research, Vol. 171, Iss. 1, 2009-10 ,pp. : 3-25

Springer Publishing Company

Access to resources Recommend Favorite

Redundant modeling in permutation weighted constraint satisfaction problems

By Law Yat  

Constraints, Vol. 15, Iss. 3, 2010-07 ,pp. : 354-403

Springer Publishing Company

Access to resources Recommend Favorite

Handling structured and ambiguous constraints in constraint satisfaction problems

By Naanaa Wady   Pimont Simone  

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 10, Iss. 1, 1998-01 ,pp. : 91-102

Taylor & Francis Ltd

Access to resources Recommend Favorite