A probabilistic analysis of randomly generated binary constraint satisfaction problems

Author： Dyer M.   Frieze A.   Molloy M.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.290, Iss.3, 2003-01, pp. : 1815-1828

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

GA performance distributions and randomly generated binary constraint satisfaction problems

By Naudts B.   Schoofs L.  

Theoretical Computer Science, Vol. 287, Iss. 1, 2002-09 ,pp. : 167-185

Elsevier

Access to resources Recommend Favorite

Constructing an asymptotic phase transition in random binary constraint satisfaction problems

By Smith B.M.  

Theoretical Computer Science, Vol. 265, Iss. 1, 2001-08 ,pp. : 265-283

Elsevier

Access to resources Recommend Favorite

Robust Parameter Settings for Variation Operators by Measuring the Resampling Ratio: A Study on Binary Constraint Satisfaction Problems

By van Hemert Jano I.   Bäck Thomas  

Journal of Heuristics, Vol. 10, Iss. 6, 2004-12 ,pp. : 629-640

Springer Publishing Company

Access to resources Recommend Favorite

On the Hamming distance of constraint satisfaction problems

By Crescenzi P.   Rossi G.  

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

Elsevier

Access to resources Recommend Favorite

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