Research map / Learning theory and algorithms / Combinatorial and search optimization
FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints
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 FourierSAT instead of MonoSAT | Solving minimum vertex covering constraints · Minimum vertex covering | problems solved: 420 -> 472 | Helped |
| Use FourierSAT instead of MiniCARD | Solving minimum vertex covering constraints · Minimum vertex covering | problems solved: 261 -> 472 | Helped |
| Use FourierSAT instead of WalkSAT with CNF encoding | Parity learning with error · Parity learning with error | problems solved: 79 -> all 300 | Helped |
| Use FourierSAT instead of WalkSAT with Sequential Counter encoding | Random CNF-XOR-CARD formulas · Random CNF-XOR-CARD formulas | problems solved: 2272 -> 2957 | Helped |
| Use FourierSAT instead of WalkSAT with Sorting Network encoding | Random CNF-XOR-CARD formulas · Random CNF-XOR-CARD formulas | problems solved: 2444 -> 2957 | Helped |
| Use FourierSAT instead of WalkSAT with Totalizer encoding | Random CNF-XOR-CARD formulas · Random CNF-XOR-CARD formulas | problems solved: 2452 -> 2957 | Helped |
| Use FourierSAT instead of WalkSAT with any tested cardinality encoding except Sequential Counter | Random vertex-covering benchmarks · Minimum vertex covering | problems solved | Helped |
| Use FourierSAT instead of Cryptominisat on parity learning with CNF+XOR | Parity learning with error · Parity learning with error | problems solved | No clear effect |
| Use FourierSAT instead of Cryptominisat on parity learning with pure CNF | Parity learning with error · Parity learning with error | problems solved | Helped |
| Use FourierSAT instead of Cryptominisat | Random hybrid constraints · Random CNF-XOR-CARD formulas | problems solved | Hurt |
Closest papers by meaning
- Unifying Decision and Function Queries in Stochastic Boolean Satisfiability (AAAI 2024 · similarity 0.88)
- The Impact of Literal Sorting on Cardinality Constraint Encodings (AAAI 2025 · similarity 0.88)
- Massively Parallel Continuous Local Search for Hybrid SAT Solving on GPUs (AAAI 2025 · similarity 0.87)
- Solving Higher-Order Quantified Boolean Satisfiability via Higher-Order Model Checking (AAAI 2025 · similarity 0.87)
- Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT (AAAI 2025 · similarity 0.87)
- SAT-Based Tree Decomposition with Iterative Cascading Policy Selection (AAAI 2024 · similarity 0.87)
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.