Worst case examples for operations on OBDDs

DOI10.1016/S0020-0190(00)00053-3zbMATH Open1339.68124MaRDI QIDQ294746FDOQ294746

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

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

zbMATH Keywords

computational complexityBoolean functionsordered binary decision diagramsvariable ordering

Mathematics Subject Classification ID

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

Cites Work

• Graph-Based Algorithms for Boolean Function Manipulation
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the effect of local changes in the variable ordering of ordered decision diagrams

Cited In (2)

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

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)