Spines of random constraint satisfaction problems: definition and connection with computational complexity (Q812393): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2768371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Efficiency of Resolution and Davis--Putnam Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal optimization of graph partitioning at the percolation threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nature's way of optimizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples for resolution / 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: Frozen development in graph coloring / 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: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weak pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics methods and phase transitions in optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and thresholds for random constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Resolution Complexity of Random Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4704799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Random Graphs / rank
 
Normal rank

Latest revision as of 10:34, 24 June 2024

scientific article
Language Label Description Also known as
English
Spines of random constraint satisfaction problems: definition and connection with computational complexity
scientific article

    Statements

    Spines of random constraint satisfaction problems: definition and connection with computational complexity (English)
    0 references
    0 references
    0 references
    0 references
    23 January 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    constraint satisfaction problems
    0 references
    phase transitions
    0 references
    spine
    0 references
    resolution complexity
    0 references
    0 references
    0 references
    0 references