Fast multiplication of matrices over a finitely generated semiring
From MaRDI portal
Publication:963453
Recommendations
Cites work
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 3340123 (Why is no real title available?)
- A practical algorithm for Boolean matrix multiplication
- Fast context-free grammar parsing requires fast Boolean matrix multiplication
- Fast recognition of pushdown automaton and context-free languages
- Gaussian elimination is not optimal
- General context-free recognition in less than cubic time
- Introduction to algorithms
- Matrix multiplication for finite algebraic systems
- Matrix multiplication via arithmetic progressions
Cited in
(2)
This page was built for publication: Fast multiplication of matrices over a finitely generated semiring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963453)