Lund University Publicationsmetadata only
A geometric approach to Boolean matrix multiplication
computer sciences, sweep-line method, running time, asymptotic upper bounds, spanning tree, time probability, monotone circuits, combinatorial algorithm
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 785365
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.