scientific article; zbMATH DE number 1354131

MaRDI QIDQ4268445zbMATH OpenFDO

Authors Seiichiro Tani, Kiyoharu Hamaguchi, S. Yajima

Publication date 31 October 1999

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Cited in

(11)

• Size of ordered binary decision diagrams representing threshold functions
• On the use of MTBDDs for performability analysis and verification of stochastic systems.
• The complexity of minimizing and learning OBDDs and FBDDs
• Hardness of indentifying the minimum ordered binary decision diagram
• The nonapproximability of OBDD minimization
• Minimization problems for parity OBDDs
• Binary decision diagrams
• On the Influence of the State Encoding on OBDD-Representations of Finite State Machines
• On the complexity of constructing optimal ordered binary decision diagrams
• Learning ordered binary decision diagrams
• Quantum algorithm for finding the optimal variable ordering for binary decision diagrams

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268445)