The Satisfiability Threshold for a Seemingly Intractable Random Constraint Satisfaction Problem

Autor:	Connamacher, Harold, Molloy, Michael
Rok vydání:	2012
Předmět:	Computer Science - Discrete Mathematics
Druh dokumentu:	Working Paper
Popis:	We determine the exact threshold of satisfiability for random instances of a particular NP-complete constraint satisfaction problem (CSP). This is the first random CSP model for which we have determined a precise linear satisfiability threshold, and for which random instances with density near that threshold appear to be computationally difficult. More formally, it is the first random CSP model for which the satisfiability threshold is known and which shares the following characteristics with random k-SAT for k >= 3. The problem is NP-complete, the satisfiability threshold occurs when there is a linear number of clauses, and a uniformly random instance with a linear number of clauses asymptotically almost surely has exponential resolution complexity. Comment: This is the long version of a paper that will be published in the SIAM Journal on Discrete Mathematics. This long version includes an appendix and a computer program. The contents of the paper are unchanged in the latest version. The format of the arxiv submission was changed so that the computer program will appear as an ancillary file. Some comments in the computer program were updated
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1202.0042 Zobrazit plný text záznamu View this record from Arxiv