scientific article; zbMATH DE number 1354131
From MaRDI portal
Publication:4268445
zbMath0925.68198MaRDI QIDQ4268445
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
Publication date: 31 October 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Related Items (10)
The complexity of minimizing and learning OBDDs and FBDDs ⋮ On the Influence of the State Encoding on OBDD-Representations of Finite State Machines ⋮ Binary Decision Diagrams ⋮ On the complexity of constructing optimal ordered binary decision diagrams ⋮ Size of ordered binary decision diagrams representing threshold functions ⋮ Learning ordered binary decision diagrams ⋮ On the use of MTBDDs for performability analysis and verification of stochastic systems. ⋮ Minimization problems for parity OBDDs ⋮ Hardness of indentifying the minimum ordered binary decision diagram ⋮ The nonapproximability of OBDD minimization
This page was built for publication:
