The SAT-UNSAT transition for random constraint satisfaction problems (Q1025462): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2008.04.025 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.04.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047532073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random constraint satisfaction: A more accurate picture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized satisfiability problems: Minimal elements and phase transitions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial sharpness criterion and phase transition classification for random CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp threshold for the renameable-Horn and the \(q\)-Horn properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersaturated graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp threshold for a random constraint satisfaction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp thresholds of graph properties, and the $k$-sat problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hunting for sharp thresholds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The phase transition in a random hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for Random Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks of constraints: Fundamental properties and applications to picture processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4954175 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2008.04.025 / rank
 
Normal rank

Latest revision as of 13:33, 10 December 2024

scientific article
Language Label Description Also known as
English
The SAT-UNSAT transition for random constraint satisfaction problems
scientific article

    Statements

    The SAT-UNSAT transition for random constraint satisfaction problems (English)
    0 references
    0 references
    0 references
    19 June 2009
    0 references
    random structures
    0 references
    constraint satisfaction
    0 references
    satisfiability
    0 references
    phase transition
    0 references
    sharp thresholds
    0 references

    Identifiers