The satisfiability threshold for randomly generated binary constraint satisfaction problems

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

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 are robust in the sense that they exhibit a non-trivial threshold of satisfiability, and we determine the asymptotic order of that threshold. We also provide resolution complexity lower bounds for these models. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Frieze, A., & Molloy, M. (2003). The satisfiability threshold for randomly generated binary constraint satisfaction problems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2764, 275–289. https://doi.org/10.1007/978-3-540-45198-3_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