Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length
From MaRDI portal
Publication:2111656
DOI10.1016/J.PHYSA.2022.128367OpenAlexW4310431054MaRDI QIDQ2111656FDOQ2111656
Zhe Zhang, Guangyan Zhou, Wei Xu
Publication date: 17 January 2023
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2022.128367
phase transitionconstraint satisfaction problembelief propagationproblem hardnesssolution space structure
Cites Work
- Title not available (Why is that?)
- Two solutions to diluted \(p\)-spin models and XORSAT problems
- On the freezing of variables in random constraint satisfaction problems
- Gibbs states and the set of solutions of random constraint satisfaction problems
- Information, Physics, and Computation
- On the solution‐space geometry of random constraint satisfaction problems
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- On the constraint length of random \(k\)-CSP
- A general model and thresholds for random constraint satisfaction problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains
- On the phase transitions of random \(k\)-constraint satisfaction problems
- Random constraint satisfaction: Flaws and structure
- Constructing an asymptotic phase transition in random binary constraint satisfaction problems
- On the solution-space geometry of random constraint satisfaction problems
- The satisfiability threshold for randomly generated binary constraint satisfaction problems
- Principles and Practice of Constraint Programming – CP 2004
- Survey propagation: An algorithm for satisfiability
- Clustering phase of a general constraint satisfaction problem model \(d\)-\(k\)-CSP
- Quiet Planting in the Locked Constraint Satisfaction Problems
- Generating hard satisfiable formulas by hiding solutions deceptively
- Title not available (Why is that?)
- Survey propagation as local equilibrium equations
- Theory and Applications of Satisfiability Testing
- On the survey-propagation equations in random constraint satisfiability problems
- The solution space structure of planted constraint satisfaction problems with growing domains
This page was built for publication: Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111656)