Exact Phase Transitions in Random Constraint Satisfaction Problems

Simple item page
dc.creatorXu, Ke
dc.creatorLi, Wei
dc.date2000-04-16
dc.date.accessioned2026-07-07T03:16:09Z
dc.date.available2026-07-07T03:16:09Z
dc.descriptionIn this paper we propose a new type of random CSP model, called Model RB, which is a revision to the standard Model B. It is proved that phase transitions from a region where almost all problems are satisfiable to a region where almost all problems are unsatisfiable do exist for Model RB as the number of variables approaches infinity. Moreover, the critical values at which the phase transitions occur are also known exactly. By relating the hardness of Model RB to Model B, it is shown that there exist a lot of hard instances in Model RB.
dc.descriptionSee http://www.jair.org/ for any accompanying files
dc.identifierhttps://arxiv.org/abs/cs/0004005
dc.identifierhttp://arxiv.org/abs/cs/0004005
dc.identifierJournal of Artificial Intelligence Research, Vol 12, (2000), 93-103.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30243
dc.subjectArtificial Intelligence
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.subjectI.2.8; G.3
dc.titleExact Phase Transitions in Random Constraint Satisfaction Problems
dc.typetext

Files

Collections

arXiv