Research map / Learning theory and algorithms / Combinatorial and search optimization
A Cardinal Improvement to Pseudo-Boolean Solving
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
- Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning (AAAI 2021 · similarity 0.91)
- FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints (AAAI 2020 · similarity 0.91)
- The Impact of Literal Sorting on Cardinality Constraint Encodings (AAAI 2025 · similarity 0.89)
- Hardness of Random Reordered Encodings of Parity for Resolution and CDCL (AAAI 2024 · similarity 0.88)
- Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs (AAAI 2024 · similarity 0.86)
- Can Transformers Reason Logically? A Study in SAT Solving (ICML 2025 · similarity 0.86)
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.