Research map / Learning theory and algorithms / Sample complexity
Phase Transitions for Scale-Free SAT Formulas
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| decrease power-law exponent beta from 2.6 to 2.4 at density 2.28 | scale-free 3-SAT with MapleCOMSPS and march_hi · scale-free 3-SAT, m/n = 2.28 | solver runtime scaling | Helped |
| increase clause length k from 3 to 4 | scale-free random k-SAT · phase diagram | sat/unsat transition location | Mixed |
| use scale-free instead of uniform formulas | random 3-SAT with MiniSAT · runtime vs density | hardness | Helped |
| use stochastic local search probSAT instead of complete solvers | scale-free 3-SAT · phase diagram | lower bound on satisfiable threshold | Helped |
| use march_hi instead of MapleCOMSPS | scale-free k-SAT · satisfiable phase | density solved | Hurt |
Closest papers by meaning
- Local Search for Hard SAT Formulas: The Strength of the Polynomial Law (AAAI 2016 · similarity 0.89)
- Satisfiability and Algorithms for Non-uniform Random k-SAT (AAAI 2021 · similarity 0.88)
- Hardness of Random Reordered Encodings of Parity for Resolution and CDCL (AAAI 2024 · similarity 0.84)
- Unifying Decision and Function Queries in Stochastic Boolean Satisfiability (AAAI 2024 · similarity 0.83)
- An Approximate Skolem Function Counter (AAAI 2024 · similarity 0.83)
- Engineering an Exact Pseudo-Boolean Model Counter (AAAI 2024 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.