A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices (Q2027889)
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: A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices |
scientific article; zbMATH DE number 7352007
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices |
scientific article; zbMATH DE number 7352007 |
Statements
A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices (English)
0 references
28 May 2021
0 references
transitive closure of graph
0 references
Boolean matrix multiplication
0 references
matrix multiplication over rings
0 references
bit complexity
0 references
Boolean circuits
0 references
size and depth
0 references
modular addition and multiplication
0 references
0 references
0.8760739
0 references
0.87230915
0 references
0.87059253
0 references
0 references
0.86774707
0 references
0.8662573
0 references
0.8650589
0 references
