Research map / Learning theory and algorithms / Combinatorial and search optimization
Schur Number Five
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 a clause-based look-ahead heuristic that favors reduced positive clauses | Cube-and-conquer SAT solving for Schur number five · Schur number five | computational effort | Helped |
| Use cube-and-conquer splitting rather than CDCL alone | SAT solving subproblems · Schur number five subproblem | runtime | Helped |
| Partition hard subproblems further using a runtime-based hardness predictor | Cube-and-conquer partitioning · Schur number five | subproblem manageability | Helped |
Closest papers by meaning
- A SAT + Computer Algebra System Verification of the Ramsey Problem R(3, 8) (Student Abstract) (AAAI 2024 · similarity 0.89)
- A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem (Student Abstract) (AAAI 2024 · similarity 0.82)
- Solving Higher-Order Quantified Boolean Satisfiability via Higher-Order Model Checking (AAAI 2025 · similarity 0.81)
- Computationally Hard Problems Are Hard for QBF Proof Systems Too (AAAI 2025 · similarity 0.81)
- DiverSAT: A Novel and Effective Local Search Algorithm for Diverse SAT Problem (AAAI 2025 · similarity 0.81)
- The Ramanujan Library - Automated Discovery on the Hypergraph of Integer Relations (ICLR 2025 · similarity 0.81)
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.