A model of random industrial SAT (Q2118866): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4862623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson approximation for non-backtracking random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Community Structure of SAT Formulas / 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: The asymptotic \(k\)-SAT threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Satisfiability Conjecture for Large k / 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: Balls and bins: A study in negative dependence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating SAT instances with community structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bound on the probability of a binomial exceeding its expectation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold for unsatisfiability / 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: Approximating the unsatisfiability threshold of random formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4153377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine learning-based restart policy for CDCL SAT solvers / 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: Impact of Community Structure on SAT Solver Performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Between SAT and UNSAT: The Fundamental Difference in CDCL SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4751910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247202 / rank
 
Normal rank

Latest revision as of 11:10, 28 July 2024

scientific article
Language Label Description Also known as
English
A model of random industrial SAT
scientific article

    Statements

    A model of random industrial SAT (English)
    0 references
    0 references
    0 references
    0 references
    23 March 2022
    0 references
    0 references
    SAT
    0 references
    industrial SAT
    0 references
    random SAT
    0 references
    satisfiability threshold
    0 references
    balls and bins problem
    0 references
    0 references
    0 references
    0 references