On the constraint length of random $$k$$ k -CSP

Guangyan Zhou (), Zongsheng Gao () and Jun Liu ()
Additional contact information
Guangyan Zhou: Beihang University
Zongsheng Gao: Beihang University
Jun Liu: Beihang University

Journal of Combinatorial Optimization, 2015, vol. 30, issue 1, No 15, 188-200

Abstract: Abstract Consider an instance $$I$$ I of the random $$k$$ k -constraint satisfaction problem ( $$k$$ k -CSP) with $$n$$ n variables and $$t=r\frac{n\ln d}{-\ln (1-p)}$$ t = r n ln d - ln ( 1 - p ) constraints, where $$d$$ d is the domain size of each variable and $$p$$ p determines the tightness of the constraints. Suppose that $$d\ge 2$$ d ≥ 2 , $$r>0$$ r > 0 and $$0 1/2$$ α > 1 / 2 . We prove that $$\begin{aligned} \nonumber \lim _{n\rightarrow \infty }\mathbf{ Pr } [I\ \text{ is } \text{ satisfiable }]=\left\{ \begin{array}{cc} 1 &{}\quad \text{ r } 1. \\ \end{array} \right. \end{aligned}$$ lim n → ∞ Pr [ I is satisfiable ] = 1 r 1 . Similar results also hold for the $$k$$ k - $$hyper$$ h y p e r - $$\mathbf {F}$$ F - $$linear$$ l i n e a r CSP which is obtained by incorporating certain algebraic structures to the domains and constraint relations of $$k$$ k -CSP.

Keywords: $$k$$ k -CSP; The second moment method; Threshold phenomena; Phase transition (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9731-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:30:y:2015:i:1:d:10.1007_s10878-014-9731-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9731-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().