Lower bounds on the OBDD size of two fundamental functions' graphs
From MaRDI portal
Publication:845898
DOI10.1016/J.IPL.2006.08.004zbMATH Open1185.68882OpenAlexW2080080500MaRDI QIDQ845898FDOQ845898
Authors: Daniel Sawitzki 
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.08.004
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Data structures (68P05)
Cites Work
- Branching Programs and Binary Decision Diagrams
- Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms
- Title not available (Why is that?)
- SOFSEM 2004: Theory and Practice of Computer Science
- On the size of binary decision diagrams representing Boolean functions
- On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
- Title not available (Why is that?)
- Algorithms and Computation
- Mathematical Foundations of Computer Science 2003
- Graph-Theoretic Concepts in Computer Science
- SOFSEM 2005: Theory and Practice of Computer Science
- Title not available (Why is that?)
Cited In (7)
- Title not available (Why is that?)
- Exact OBDD bounds for some fundamental functions
- Exact OBDD Bounds for Some Fundamental Functions
- Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms
- SOFSEM 2005: Theory and Practice of Computer Science
- On the OBDD representation of some graph classes
- On the OBDD size for graphs of bounded tree- and clique-width
This page was built for publication: Lower bounds on the OBDD size of two fundamental functions' graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845898)
