Least upper bounds on OBDD sizes

DOI10.1109/12.286311MaRDI QIDQ4420060zbMATHOpenAlexFDO

Authors Mark A. Heap, M. R. Mercer

Publication date 13 August 2003

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.286311

zbMATH Keywords

data compressionordered binary decision diagramsBollean function representation

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07)

Recommendations

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

Cited in

(6)

• A theoretical and numerical analysis of the worst-case size of reduced ordered binary decision diagrams
• Constructing small tree grammars and small circuits for formulas
• On the evolution of the worst-case OBDD size
• Output-size sensitiveness of OBDD construction through maximal independent set problem
• scientific article; zbMATH DE number 1543030 (Why is no real title available?)
• Ordered binary decision diagrams and the Shannon effect

This page was built for publication: Least upper bounds on OBDD sizes

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