A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication

We use randomness to exploit the potential sparsity of the Boolean matrix product in order to speed up the computation of the product. Our new fast output-sensitive algorithm for Boolean matrix product and its witnesses is randomized and provides the Boolean product and its witnesses almost certainl...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 61; číslo 1; s. 36 - 50
Hlavný autor:	Lingas, Andrzej
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer US 01.09.2011
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Computer and Information Sciences Computer Science Computer Sciences Computer Systems Organization and Communication Networks Data Structures and Information Theory Data- och informationsvetenskap (Datateknik) Datavetenskap (Datalogi) Mathematics of Computing Natural Sciences Naturvetenskap Theory of Computation Rectangular matrix multiplication Boolean matrix multiplication Time complexity Output-sensitive algorithm
ISSN:	0178-4617, 1432-0541, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!