A comparison of free BDDs and transformed BDDs

DOI10.1023/A:1011229414976zbMath1053.68071OpenAlexW1576616300MaRDI QIDQ5949487

Ingo Wegener, Detlef Sieling

Publication date: 2001

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011229414976

zbMATH Keywords

ordered binary decision diagrams

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs ⋮ Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs

This page was built for publication: A comparison of free BDDs and transformed BDDs