Pages that link to "Item:Q1251068"
From MaRDI portal
The following pages link to Improved time and space bounds for Boolean matrix multiplication (Q1251068):
Displaying 5 items.
- Parsing by matrix multiplication generalized to Boolean grammars (Q385966) (← links)
- A note on Boolean matrix multiplication (Q761038) (← links)
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (Q1075771) (← links)
- A practical algorithm for Boolean matrix multiplication (Q1111377) (← links)
- A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph (Q2032176) (← links)