Fast recognition of pushdown automaton and context-free languages
Information and Control
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
Fast algorithms with preprocessing for matrix-vector multiplication problems
Journal of Complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Nearly optimal computations with structured matrices
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Structured matrices and polynomials: unified superfast algorithms
Structured matrices and polynomials: unified superfast algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Polynomial evaluation via the division algorithm the fast Fourier transform revisited
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
On Diameter Verification and Boolean Matrix Multiplication.
On Diameter Verification and Boolean Matrix Multiplication.
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
All-pairs shortest paths with real weights in O(n3/ log n) time
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
On the Shortest Linear Straight-Line Program for Computing Linear Forms
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
The Mailman algorithm: A note on matrix--vector multiplication
Information Processing Letters
Edit distance with duplications and contractions revisited
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Faster Algorithms for Max-Product Message-Passing
The Journal of Machine Learning Research
Parsing by matrix multiplication generalized to Boolean grammars
Theoretical Computer Science
| Hi-index | 0.00 |
We show that any n x n matrix A over any finite semiring can be preprocessed in O(n2+ε) time, such that all subsequent vector multiplications with A can be performed in O(n2/(εlogn)2) time, for all ε 0. The approach is combinatorial and can be implemented on a pointer machine or a (logn)-word RAM. Some applications are described.