A model of random industrial SAT
From MaRDI portal
Publication:2118866
DOI10.1016/J.TCS.2022.01.038OpenAlexW4210638834MaRDI QIDQ2118866FDOQ2118866
Authors: D. Barak-Pelleg, Daniel Berend, J. C. Saunders 
Publication date: 23 March 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.00089
Cites Work
- Title not available (Why is that?)
- The complexity of theorem-proving procedures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Balls and bins: A study in negative dependence
- Approximating the unsatisfiability threshold of random formulas
- The community structure of SAT formulas
- Generating SAT instances with community structure
- Impact of Community Structure on SAT Solver Performance
- Proof of the Satisfiability Conjecture for Large k
- The threshold for random ๐-SAT is 2^{๐}log2-๐(๐)
- Tight lower bound on the probability of a binomial exceeding its expectation
- Between SAT and UNSAT: The Fundamental Difference in CDCL SAT
- On the satisfiability threshold of formulas with three literals per clause
- Title not available (Why is that?)
- Title not available (Why is that?)
- The scaling window of the 2-SAT transition
- The probabilistic analysis of a greedy satisfiability algorithm
- A threshold for unsatisfiability
- Threshold values of random KโSAT from the cavity method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
- Poisson approximation for non-backtracking random walks
- The asymptotic \(k\)-SAT threshold
- Machine learning-based restart policy for CDCL SAT solvers
Cited In (2)
Uses Software
This page was built for publication: A model of random industrial SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118866)
