Pages that link to "Item:Q5671565"
From MaRDI portal
The following pages link to A fast expected time algorithm for Boolean matrix multiplication and transitive closure (Q5671565):
Displayed 5 items.
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (Q1075771) (← links)
- Computational experiences with some transitive closure algorithms (Q1229720) (← links)
- Mathematical solution for a data processing system (Q1254113) (← links)
- New applications of the incompressibility method. II (Q1978700) (← links)
- On efficiently computing the product of two binary relations (Q4109192) (← links)
