Fast multiplication of matrices over a finitely generated semiring

Authors:
Daniel Andrén;Lars Hellström;Klas Markström
Affiliations:
Department of Mathematics and Mathematical Statistics, Umeå University, SE-901 87 Umeå, Sweden;Department of Mathematics and Mathematical Statistics, Umeå University, SE-901 87 Umeå, Sweden;Department of Mathematics and Mathematical Statistics, Umeå University, SE-901 87 Umeå, Sweden
Venue:
Information Processing Letters
Year:
2008

Citing 8
Cited 1

Fast recognition of pushdown automaton and context-free languages

Information and Control
Matrix multiplication for finite algebraic systems

Information Processing Letters
A practical algorithm for Boolean matrix multiplication

Information Processing Letters
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Introduction to algorithms

Introduction to algorithms
Fast context-free grammar parsing requires fast boolean matrix multiplication

Journal of the ACM (JACM)
Semiring parsing

Computational Linguistics
General context-free recognition in less than cubic time

Journal of Computer and System Sciences

Optimal design of Hermitian transform and vectors of both mask and window coefficients for denoising applications with both unknown noise characteristics and distortions

Signal Processing

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper we show that nxn matrices with entries from a semiring R which is generated additively by q generators can be multiplied in time O(q^2n^@w), where n^@w is the complexity for matrix multiplication over a ring (Strassen: @w