Research map / Learning theory and algorithms / Combinatorial and search optimization
SDDs Are Exponentially More Succinct than OBDDs
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
- An And-Sum Circuit with Signed Edges That Is More Succinct than SDD (AAAI 2025 · similarity 0.88)
- Learning Minimum-Size BDDs: Towards Efficient Exact Algorithms (ICML 2025 · similarity 0.87)
- Tensor Decomposition Meets Knowledge Compilation: A Study Comparing Tensor Trains with OBDDs (AAAI 2025 · similarity 0.86)
- A Compositional Atlas for Algebraic Circuits (NeurIPS 2024 · similarity 0.84)
- New Compilation Languages Based on Restricted Weak Decomposability (AAAI 2025 · similarity 0.83)
- On the Expressive Power of Tree-Structured Probabilistic Circuits (NeurIPS 2024 · similarity 0.83)
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.