Research map / Learning theory and algorithms / Combinatorial and search optimization
Local Search for Hard SAT Formulas: The Strength of the Polynomial Law
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.
Closest papers by meaning
- Satisfiability and Algorithms for Non-uniform Random k-SAT (AAAI 2021 · similarity 0.89)
- Phase Transitions for Scale-Free SAT Formulas (AAAI 2017 · similarity 0.89)
- Should Algorithms for Random SAT and Max-SAT Be Different? (AAAI 2017 · similarity 0.88)
- DiverSAT: A Novel and Effective Local Search Algorithm for Diverse SAT Problem (AAAI 2025 · similarity 0.85)
- Unifying Decision and Function Queries in Stochastic Boolean Satisfiability (AAAI 2024 · similarity 0.85)
- Massively Parallel Continuous Local Search for Hybrid SAT Solving on GPUs (AAAI 2025 · similarity 0.85)
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.