πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space

DOI10.1007/978-3-642-21581-0_9zbMath1330.68274OpenAlexW90167411MaRDI QIDQ3007676

Shin-ichi Minato

Publication date: 17 June 2011

Published in: Theory and Applications of Satisfiability Testing - SAT 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21581-0_9

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (7)

Using πDDs in the Design of Reversible Circuits ⋮ Factorization using binary decision diagrams ⋮ Using $$\pi $$ DDs for Nearest Neighbor Optimization of Quantum Circuits ⋮ Classical length-5 pattern-avoiding permutations ⋮ \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem ⋮ Improved Algorithms for Debugging Problems on Erroneous Reversible Circuits ⋮ Decision diagrams for solving a job scheduling problem under precedence constraints

Uses Software

• GAP
• ZRes

Cites Work

• Graph-Based Algorithms for Boolean Function Manipulation
• The Diameter of the Rubik's Cube Group Is Twenty
• Unnamed Item
• Unnamed Item

This page was built for publication: πDD: A New Decision Diagram for Efficient Problem Solving in Permutation Space