Research map / Learning theory and algorithms / Combinatorial and search optimization
An Improved Upper Bound for SAT
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 |
|---|---|---|---|
| Use amortized analysis with the branch-and-search algorithm, reduction rules, and case analysis | SAT exact algorithm · SAT (CNF, m clauses) | running time upper bound: O^*(1.234^m) -> O^*(1.2226^m) | Helped |
| Use amortized analysis instead of direct branching-factor analysis | SAT branch-and-search algorithm · SAT (CNF, m clauses) | running time upper bound: O^*(1.2600^m) -> O^*(1.2226^m) | Helped |
Closest papers by meaning
- New Length Dependent Algorithm for Maximum Satisfiability Problem (AAAI 2021 · similarity 0.91)
- Improved Algorithms for Maximum Satisfiability and Its Special Cases (AAAI 2023 · similarity 0.89)
- Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph (AAAI 2024 · similarity 0.89)
- Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT (AAAI 2025 · similarity 0.85)
- SAT-Based Tree Decomposition with Iterative Cascading Policy Selection (AAAI 2024 · similarity 0.84)
- Hardness of Random Reordered Encodings of Parity for Resolution and CDCL (AAAI 2024 · similarity 0.83)
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.