Research map / Learning theory and algorithms / Combinatorial and search optimization
Faster Algorithms for Weak Backdoors
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 |
|---|---|---|---|
| Reduce WB(3CNF, 0-VAL) to Ball-3-SAT, using the all-false assignment as the starting point | WB(3CNF, 0-VAL) · WB(3CNF, 0-VAL) | running time: O∗(2.85k) -> O∗(2.562k) | Helped |
| Reduce WB(3CNF, NULL) to Conflict-free d-Hitting Set | WB(3CNF, NULL) · WB(3CNF, NULL) | running time: O∗(3k) -> O∗(2.2738k) | Helped |
| Restructure branching priorities and use structural analysis to rule out the slowest cases | WB(3CNF, HORN) · WB(3CNF, HORN) | running time: O∗(4.54k) -> O∗(4.17k) | Helped |
Closest papers by meaning
- On Probabilistic Generalization of Backdoors in Boolean Satisfiability (AAAI 2022 · similarity 0.92)
- On Cryptographic Attacks Using Backdoors for SAT (AAAI 2018 · similarity 0.89)
- Probabilistic Generalization of Backdoor Trees with Application to SAT (AAAI 2023 · similarity 0.87)
- Solving Higher-Order Quantified Boolean Satisfiability via Higher-Order Model Checking (AAAI 2025 · similarity 0.86)
- DiverSAT: A Novel and Effective Local Search Algorithm for Diverse SAT Problem (AAAI 2025 · similarity 0.85)
- Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph (AAAI 2024 · similarity 0.84)
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.