Worst case examples for operations on OBDDs

DOI10.1016/S0020-0190(00)00053-3MaRDI QIDQ294746zbMATH OpenFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1670823
• Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
• scientific article; zbMATH DE number 1775052
• scientific article; zbMATH DE number 1150567
• Exact OBDD Bounds for Some Fundamental Functions

Cites work

• scientific article; zbMATH DE number 4094813 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Graph-Based Algorithms for Boolean Function Manipulation
• On the effect of local changes in the variable ordering of ordered decision diagrams

Cited in

(2)

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

Describes a project that uses

Uses Software

• ROBDD

This page was built for publication: Worst case examples for operations on OBDDs

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