Random <i>k</i> -SAT and the power of two choices (Q3192377): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lower bounds for random 3-SAT via differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random <i>k</i>‐SAT: Two Moments Suffice to Cross a Sharp Threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation models with limited choice and the multiplicative coalescent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding a giant component / rank
 
Normal rank
Property / cites work
 
Property / cites work: Creating a Giant Component / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Evolution of Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The scaling window of the 2-SAT transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular random \(k\)-SAT: Properties of balanced formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embracing the giant component / 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: The Bohman-Frieze process near criticality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting Complementary Pairs of Literals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding small subgraphs in Achlioptas processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity thresholds in Achlioptas processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Random Satisfiable Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small subgraphs in random graphs and the power of multiple choices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achlioptas process phase transitions are continuous / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delaying satisfiability for random 2SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Birth control for giants / rank
 
Normal rank

Latest revision as of 20:54, 10 July 2024

scientific article
Language Label Description Also known as
English
Random <i>k</i> -SAT and the power of two choices
scientific article

    Statements

    Random <i>k</i> -SAT and the power of two choices (English)
    0 references
    0 references
    12 October 2015
    0 references
    satisfiability
    0 references
    random formulas
    0 references
    \(k\)-SAT
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references