Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms (Q3525811)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5345318
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms |
scientific article; zbMATH DE number 5345318 |
Statements
Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms (English)
0 references
18 September 2008
0 references
0.9228849411010742
0 references
0.9143704771995544
0 references
0.8841784596443176
0 references
0.8713244199752808
0 references
0.8678889870643616
0 references
