Exponential space complexity for OBDD-based reachability analysis (Q1675755)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exponential space complexity for OBDD-based reachability analysis |
scientific article; zbMATH DE number 6802633
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exponential space complexity for OBDD-based reachability analysis |
scientific article; zbMATH DE number 6802633 |
Statements
Exponential space complexity for OBDD-based reachability analysis (English)
0 references
3 November 2017
0 references
computational complexity
0 references
lower bounds
0 references
ordered binary decision diagrams
0 references
reachability analysis
0 references
transitive closure
0 references
0 references
0 references
0.8906312
0 references
0.84464616
0 references
0.84186846
0 references
0.84186846
0 references
0.8382794
0 references
0.8356187
0 references
