The scaling window of the model \(d\)-\(k\)-CSP
From MaRDI portal
Publication:890505
DOI10.1016/j.jmaa.2015.09.015zbMath1334.82035OpenAlexW1461974625MaRDI QIDQ890505
Guangyan Zhou, Jun Liu, Zong Sheng Gao
Publication date: 10 November 2015
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2015.09.015
Related Items (1)
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
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- A probabilistic analysis of randomly generated binary constraint satisfaction problems.
- Generalized satisfiability problems: Minimal elements and phase transitions.
- The 3-XORSAT threshold.
- A sharp threshold for a random constraint satisfaction problem
- Threshold behaviors of a random constraint satisfaction problem with exact phase transitions
- On the constraint length of random \(k\)-CSP
- Random \(k\)-SAT: A tight threshold for moderately growing \(k\)
- The scaling window of the 2-SAT transition
- Models for Random Constraint Satisfaction Problems
- The satisfiability threshold for randomly generated binary constraint satisfaction problems
- Random constraint satisfaction: A more accurate picture
- Constructing an asymptotic phase transition in random binary constraint satisfaction problems
This page was built for publication: The scaling window of the model \(d\)-\(k\)-CSP