Worst case examples for operations on OBDDs

DOI10.1016/S0020-0190(00)00053-3zbMath1339.68124MaRDI QIDQ294746

Ingo Wegener

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000533?np=y

zbMATH Keywords

computational complexityBoolean functionsordered binary decision diagramsvariable ordering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items

Weighted \(A^*\) search - unifying view and application, Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems

Uses Software

• ROBDD

Cites Work

• On the effect of local changes in the variable ordering of ordered decision diagrams
• Graph-Based Algorithms for Boolean Function Manipulation
• Unnamed Item
• Unnamed Item