Clustering phase of a general constraint satisfaction problem model \(d\)-\(k\)-CSP
From MaRDI portal
Publication:2164572
DOI10.1016/j.physa.2019.122708OpenAlexW2974084700MaRDI QIDQ2164572
Fu-Zhou Gong, Guangyan Zhou, Wei Xu
Publication date: 15 August 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2019.122708
constraint satisfaction problembelief propagationproblem hardnesssolution space structureclustering phase transition
Related Items (2)
The solution space structure of planted constraint satisfaction problems with growing domains ⋮ Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length
Cites Work
- Unnamed Item
- Unnamed Item
- A general model and thresholds for random constraint satisfaction problems
- On the phase transitions of random \(k\)-constraint satisfaction problems
- Solution clustering in random satisfiability
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Two solutions to diluted \(p\)-spin models and XORSAT problems
- Locating the phase transition in binary constraint satisfaction problems
- On the survey-propagation equations in random constraint satisfiability problems
- Sharp thresholds of graph properties, and the $k$-sat problem
- Survey propagation: An algorithm for satisfiability
- Gibbs states and the set of solutions of random constraint satisfaction problems
- The satisfiability threshold for randomly generated binary constraint satisfaction problems
- On the solution‐space geometry of random constraint satisfaction problems
- Random constraint satisfaction: Flaws and structure
- Constructing an asymptotic phase transition in random binary constraint satisfaction problems
This page was built for publication: Clustering phase of a general constraint satisfaction problem model \(d\)-\(k\)-CSP
