Sciweavers

116 search results - page 1 / 24
» On the solution-space geometry of random constraint satisfac...
Sort
View
JUCS
2007
118views more  JUCS 2007»
13 years 4 months ago
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
Gabriel Istrate
STOC
2006
ACM
100views Algorithms» more  STOC 2006»
14 years 5 months ago
On the solution-space geometry of random constraint satisfaction problems
Dimitris Achlioptas, Federico Ricci-Tersenghi
CORR
2007
Springer
120views Education» more  CORR 2007»
13 years 4 months ago
Random subcubes as a toy model for constraint satisfaction problems
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
Thierry Mora, Lenka Zdeborová
FOCS
2008
IEEE
13 years 6 months ago
A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
Siu On Chan, Michael Molloy
RSA
2006
104views more  RSA 2006»
13 years 4 months ago
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
Alan M. Frieze, Michael Molloy