Random constraint satisfaction: Theory meets practice

50Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study the experimental consequences of a recent theoretical result by Achlioptas et al. that shows that conventional models of random problems are trivially insoluble in the limit. We survey the literature to identify experimental studies that lie within the scope of this result. We then estimate theoretically and measure experimentally the size at which problems start to become trivially insoluble. Our results demonstrate that most (but not all) of these experimental studies are luckily unaffected by this result. We also study an alternative model of random problems that does not suffer from this asymptotic weakness. We show that, at a typical problem size used in experimental studies, this model looks similar to conventional models. Finally, we generalize this model so that we can independently adjust the constraint tightness and density.

Cite

CITATION STYLE

APA

Macintyre, E., Prosser, P., Smith, B., & Walsh, T. (1998). Random constraint satisfaction: Theory meets practice. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1520, pp. 325–339). Springer Verlag. https://doi.org/10.1007/3-540-49481-2_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free