Pages that link to "Item:Q1111377"
From MaRDI portal
The following pages link to A practical algorithm for Boolean matrix multiplication (Q1111377):
Displaying 9 items.
- Fast multiplication of matrices over a finitely generated semiring (Q963453) (← links)
- An efficient algorithm for calculating Boolean difference (Q1075992) (← links)
- Design of cellular manufacturing systems based on asymptotic forms of a Boolean matrix (Q1261330) (← links)
- On the use of the asymptotic forms of the Boolean matrix for designing cellular manufacturing systems. -- An improved approach (Q1278122) (← links)
- An efficiently solvable graph partition problem to which many problems are reducible (Q2365814) (← links)
- (Q4219043) (← links)
- (Q4427871) (← links)
- <i>N</i> latency 2<i>N</i> I/O‐bandwidth 2D‐array matrix multiplication algorithm (Q4542827) (← links)
- The Closest Pair Problem under the Hamming Metric (Q5323065) (← links)