Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length (Q2111656): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.physa.2022.128367 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.physa.2022.128367 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4310431054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information, Physics, and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random constraint satisfaction: Flaws and structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing an asymptotic phase transition in random binary constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The satisfiability threshold for randomly generated binary constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the phase transitions of random \(k\)-constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general model and thresholds for random constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random constraint satisfaction: easy generation of hard (satisfiable) instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: The solution space structure of planted constraint satisfaction problems with growing domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quiet Planting in the Locked Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two solutions to diluted \(p\)-spin models and XORSAT problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gibbs states and the set of solutions of random constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the freezing of variables in random constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey propagation: An algorithm for satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution-space geometry of random constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution‐space geometry of random constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the constraint length of random \(k\)-CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering phase of a general constraint satisfaction problem model \(d\)-\(k\)-CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the survey-propagation equations in random constraint satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey propagation as local equilibrium equations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.PHYSA.2022.128367 / rank
 
Normal rank

Latest revision as of 02:35, 17 December 2024

scientific article
Language Label Description Also known as
English
Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length
scientific article

    Statements

    Generating hard satisfiable instances by planting into random constraint satisfaction problem model with growing constraint scope length (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 January 2023
    0 references
    constraint satisfaction problem
    0 references
    solution space structure
    0 references
    phase transition
    0 references
    problem hardness
    0 references
    belief propagation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers