Research map / Learning theory and algorithms / Prediction and decision losses
Constructing Minimal Perfect Hash Functions Using SAT Technology
Sean Weaver, Marijn Heule
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 minimum-weight matching stored in an XORSAT filter for practical MPHF construction | XORSAT-filter MPHF · 2^30 keys | bits per key: 1.85 vs. between $2.90$ and $4.22$ | Improved |
| Use the cubic SAT encoding instead of the compact encoding (ablation) | SAT-based space-optimal MPHF · 32 keys, 46 variables | average runtime: 8.5 seconds -> 4 seconds | Improved |
| Use the compact encoding with auxiliary variables instead of the cubic encoding (ablation) | SAT-based space-optimal MPHF · 32 keys, 46 variables | average runtime: 4 seconds -> 8.5 seconds | Hurt |
| Block or shard the input and build independent MPHFs for blocks (ablation) | XORSAT-filter MPHF · Large key sets | space efficiency | Hurt |
| Increase the number of SAT variables above the information-theoretic limit (ablation) | SAT-based space-optimal MPHF · Key sets up to 40 elements | build cost | Improved |
Closest papers by meaning
- Bridging Crypto with ML-based Solvers: the SAT Formulation and Benchmarks (NeurIPS 2025 · similarity 0.84)
- BIRD: Engineering an Efficient CNF-XOR SAT Solver and Its Applications to Approximate Model Counting (AAAI 2019 · similarity 0.83)
- Learning Plaintext-Ciphertext Cryptographic Problems via ANF-based SAT Instance Representation (NeurIPS 2024 · similarity 0.81)
- Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs (AAAI 2021 · similarity 0.81)
- FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints (AAAI 2020 · similarity 0.81)
- Local Search for Hard SAT Formulas: The Strength of the Polynomial Law (AAAI 2016 · 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.
