Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter (Q4608046)
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: Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter |
scientific article; zbMATH DE number 6850460
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter |
scientific article; zbMATH DE number 6850460 |
Statements
15 March 2018
0 references
0.7844438552856445
0 references
0.7520881295204163
0 references
0.7322606444358826
0 references
