Research map / Learning theory and algorithms / Prediction and decision losses
Group Decision Diagram (GDD): A Compact Representation for Permutations
Takanori Maehara, Yuma Inoue
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 GDD instead of πDD | set of permutations representation · Pocket Cube k=11 | computation time (sec): 374.46s -> 19.50s | Improved |
| use GDD instead of ρDD | set of permutations representation · Pocket Cube k=11 | computation time (sec): 745.75s -> 19.50s | Improved |
| use GDD instead of πDD | set of permutations representation · Pocket Cube k=11 | number of nodes: 2,455,878 -> 445,928 | Improved |
| use GDD instead of ρDD | set of permutations representation · Pocket Cube k=11 | number of nodes: 6,369,842 -> 445,928 | Improved |
| use GDD instead of πDD | set of permutations representation · Pocket Cube k=14 | computation time (sec): 481.07s -> 29.18 | Improved |
| use GDD instead of ρDD | set of permutations representation · Pocket Cube k=14 | number of nodes: 6,149,175 -> 76 | Improved |
| use GDD instead of πDD | set of permutations representation · Pancake sorting n=11 | computation time (sec): 117.69s -> 126.81s | Hurt |
| use GDD instead of ρDD | set of permutations representation · Pancake sorting n=11 | computation time (sec): 39.39s -> 126.81s | Hurt |
| use GDD instead of ρDD | set of permutations representation · Pancake sorting n=11 | number of nodes: 1,021,055 -> 1,165,544 | Hurt |
| use GDD instead of πDD | set of permutations representation · Shortest zero-walk n=30 | computation time (sec): 290.74s -> 1.25s | Improved |
| use GDD instead of ρDD | set of permutations representation · Shortest zero-walk n=90 | computation time (sec): 926.80s -> 32.22s | Improved |
| use GDD instead of ρDD | set of permutations representation · Shortest zero-walk n=10 | computation time (sec): 0.16s -> 0.21s | No clear effect |
Closest papers by meaning
- Learning Minimum-Size BDDs: Towards Efficient Exact Algorithms (ICML 2025 · similarity 0.83)
- OT4P: Unlocking Effective Orthogonal Group Path for Permutation Relaxation (NeurIPS 2024 · similarity 0.83)
- Machine Learning meets Algebraic Combinatorics: A Suite of Datasets Capturing Research-level Conjecturing Ability in Pure Mathematics (ICML 2025 · similarity 0.82)
- SAT-Based Techniques for Lexicographically Smallest Finite Models (AAAI 2024 · similarity 0.82)
- A SAT + Computer Algebra System Verification of the Ramsey Problem R(3, 8) (Student Abstract) (AAAI 2024 · similarity 0.81)
- REVISITING MULTI-PERMUTATION EQUIVARIANCE THROUGH THE LENS OF IRREDUCIBLE REPRESENTATIONS (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.
