Fast multiplication of matrices over a finitely generated semiring
From MaRDI portal
Publication:963453
DOI10.1016/j.ipl.2008.03.004zbMath1189.65074OpenAlexW2047445951MaRDI QIDQ963453
Daniel Andrén, Klas Markström, Lars Hellström
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.03.004
complexitysemiringsmatrix multiplicationBoolean matrix multiplicationcombinatorial matrix multiplication algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- A practical algorithm for Boolean matrix multiplication
- General context-free recognition in less than cubic time
- Matrix multiplication for finite algebraic systems
- Gaussian elimination is not optimal
- Fast context-free grammar parsing requires fast boolean matrix multiplication
- Fast recognition of pushdown automaton and context-free languages
This page was built for publication: Fast multiplication of matrices over a finitely generated semiring
