Branching Process Approach for 2-Sat Thresholds (Q4933200): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) / 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: The ?(2) limit in the random assignment problem / 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: Q2743189 / 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: Q4228436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random 2-SAT with prescribed literal degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the satisfiability threshold of formulas with three literals per clause / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Forwarding Indices of Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation inequalities on some partially ordered sets / 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: A threshold for unsatisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp thresholds for constraint satisfaction problems and homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The probabilistic analysis of a greedy satisfiability algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit theorems for decomposable multi-dimensional Galton-Watson processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at survey propagation and its generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold values of random <i>K</i>‐SAT from the cavity method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of sampling independent sets beyond the tree threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random 2-SAT and unsatisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting independent sets up to the tree threshold / rank
 
Normal rank

Revision as of 08:19, 3 July 2024

scientific article; zbMATH DE number 5798767
Language Label Description Also known as
English
Branching Process Approach for 2-Sat Thresholds
scientific article; zbMATH DE number 5798767

    Statements

    Branching Process Approach for 2-Sat Thresholds (English)
    0 references
    0 references
    0 references
    12 October 2010
    0 references
    2-SAT
    0 references
    satisfiability
    0 references
    phase transition
    0 references
    two-type branching process
    0 references
    0 references
    0 references
    0 references

    Identifiers

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