On the evolution of the worst-case OBDD size

DOI10.1016/S0020-0190(00)00148-4MaRDI QIDQ1607073zbMATH OpenOpenAlexFDO

Authors Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav

Publication date 25 July 2002

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

Full work available at URL https://doi.org/10.1016/s0020-0190(00)00148-4

zbMATH Keywords

Boolean function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• Efficient Boolean manipulation with OBDD's can be extended to FBDD's
• Graph driven BDDs -- a new data structure for Boolean functions
• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 1948534 (Why is no real title available?)
• scientific article; zbMATH DE number 3353170 (Why is no real title available?)
• Least upper bounds on OBDD sizes
• On the OBDD-representation of general Boolean functions
• On the size of binary decision diagrams representing Boolean functions
• The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions

Cited in

(3)

• Ordered binary decision diagrams and the Shannon effect
• A theoretical and numerical analysis of the worst-case size of reduced ordered binary decision diagrams
• Output-size sensitiveness of OBDD construction through maximal independent set problem

Describes a project that uses

Uses Software

• CUDD

This page was built for publication: On the evolution of the worst-case OBDD size

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