The complexity of Boolean matrix root computation (Q3082929)
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 5867689
| 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 5867689 |
Statements
The Complexity of Boolean Matrix Root Computation (English)
0 references
18 March 2011
0 references
0.9992671608924866
0 references
0.8163553476333618
0 references
0.7969233989715576
0 references
0.7386108040809631
0 references
0.7274727821350098
0 references
