SOFSEM 2005: Theory and Practice of Computer Science

DOI10.1007/b105088zbMath1117.68339OpenAlexW2543951292MaRDI QIDQ5711546

Daniel Sawitzki

Publication date: 7 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b105088

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (5)

Lower bounds on the OBDD size of two fundamental functions' graphs ⋮ Exponential space complexity for OBDD-based reachability analysis ⋮ Larger lower bounds on the OBDD complexity of integer multiplication ⋮ A note on the size of OBDDs for the graph of integer multiplication ⋮ Larger Lower Bounds on the OBDD Complexity of Integer Multiplication

This page was built for publication: SOFSEM 2005: Theory and Practice of Computer Science