Symbolic OBDD-Based Reachability Analysis Needs Exponential Space

DOI10.1007/978-3-642-11266-9_19zbMath1274.68087OpenAlexW1578551036MaRDI QIDQ3401094

Beate Bollig

Publication date: 28 January 2010

Published in: SOFSEM 2010: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11266-9_19

zbMATH Keywords

computational complexityordered binary decision diagramslower boundstransitive closurereachability analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

This page was built for publication: Symbolic OBDD-Based Reachability Analysis Needs Exponential Space