Least upper bounds on OBDD sizes

DOI10.1109/12.286311zbMATH Open1033.68682OpenAlexW2107864677MaRDI QIDQ4420060FDOQ4420060

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)

Cited In (6)

• On the evolution of the worst-case OBDD size
• Constructing small tree grammars and small circuits for formulas
• Ordered binary decision diagrams and the Shannon effect
• Output-size sensitiveness of OBDD construction through maximal independent set problem
• Title not available (Why is that?)
• A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams

   Recommendations

• Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems 👍 👎
• Title not available (Why is that?) 👍 👎
• Exact OBDD Bounds for Some Fundamental Functions 👍 👎
• Title not available (Why is that?) 👍 👎
• Exact OBDD bounds for some fundamental functions 👍 👎

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)