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...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 61; no. 1; pp. 36 - 50
Main Author:	Lingas, Andrzej
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.09.2011
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!