The complexity of Boolean matrix root computation (Q1884841)
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: The complexity of Boolean matrix root computation |
scientific article; zbMATH DE number 2110948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of Boolean matrix root computation |
scientific article; zbMATH DE number 2110948 |
Statements
The complexity of Boolean matrix root computation (English)
0 references
27 October 2004
0 references
Boolean matrix
0 references
Root
0 references
Directed graph
0 references
Graph power
0 references
Binary relation
0 references
Computational complexity
0 references
Graph isomorphism
0 references
Subdivision
0 references
0 references
0.9992671608924866
0 references
0.8181425929069519
0 references
0.8009554743766785
0 references
0.7367303371429443
0 references
0.7294750213623047
0 references
