Satisfiability threshold for power law random 2-SAT in configuration model
From MaRDI portal
Publication:5896832
Recommendations
Cites work
- scientific article; zbMATH DE number 1256700 (Why is no real title available?)
- scientific article; zbMATH DE number 1113991 (Why is no real title available?)
- A General Upper Bound for the Satisfiability Threshold of Randomr-SAT Formulae
- A Random Graph Model for Power Law Graphs
- A better algorithm for random \(k\)-SAT
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A threshold for unsatisfiability
- Approximating the unsatisfiability threshold of random formulas
- Bounds on the satisfiability threshold for power law distributed random SAT
- Computing and Combinatorics
- Emergence of Scaling in Random Networks
- Generating SAT instances with community structure
- Generating hard satisfiability problems
- Gibbs states and the set of solutions of random constraint satisfaction problems
- Going after the \(k\)-SAT threshold
- Lower bounds for random 3-SAT via differential equations
- On the satisfiability threshold of formulas with three literals per clause
- Power-law distributions in empirical data
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
- Proof of the satisfiability conjecture for large \(k\)
- Random 2-SAT with prescribed literal degrees
- Random 2-SAT: Results and problems
- Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
- Regular random \(k\)-SAT: Properties of balanced formulas
- Sharp thresholds of graph properties, and the $k$-sat problem
- Sharpness of the satisfiability threshold for non-uniform random \(k\)-SAT
- Survey propagation: An algorithm for satisfiability
- The degree sequence of a scale-free random graph process
- The diameter of a scale-free random graph
- The probabilistic analysis of a greedy satisfiability algorithm
Cited in
(4)- Bounds on the satisfiability threshold for power law distributed random SAT
- The impact of heterogeneity and geometry on the proof complexity of random satisfiability
- Power-law Lévy processes, power-law vector random fields, and some extensions
- Satisfiability threshold for power law random 2-SAT in configuration model
This page was built for publication: Satisfiability threshold for power law random 2-SAT in configuration model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896832)
