Research map / Learning theory and algorithms / Sample complexity
New Length Dependent Algorithm for Maximum Satisfiability Problem
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 the main algorithm with discounted length L − n3 and measure-and-conquer | MAXSAT · MAXSAT, formula length L | running time: O∗(1.1057L) -> O∗(1.0927L) | Helped |
| Use the simpler algorithm with seven branching rules | MAXSAT · MAXSAT, formula length L | running time: O∗(1.1057L) -> O∗(1.1049L) | Helped |
| Use the main algorithm rather than the simpler proposed algorithm | MAXSAT · MAXSAT, formula length L | running time: O∗(1.1049L) -> O∗(1.0927L) | Helped |
Closest papers by meaning
- Improved Algorithms for Maximum Satisfiability and Its Special Cases (AAAI 2023 · similarity 0.91)
- An Improved Upper Bound for SAT (AAAI 2021 · similarity 0.91)
- Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph (AAAI 2024 · similarity 0.90)
- Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT (AAAI 2025 · similarity 0.85)
- DiverSAT: A Novel and Effective Local Search Algorithm for Diverse SAT Problem (AAAI 2025 · similarity 0.85)
- SAT-Based Tree Decomposition with Iterative Cascading Policy Selection (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.