Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms (Q3525811)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms |
scientific article |
Statements
Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms (English)
0 references
18 September 2008
0 references