Improvements of the Alder-Strassen Bound: Algebras with Nonzero Radical
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Algebras of Minimal Rank over Arbitrary Fields
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A (5/2)n2-Lower Bound for the Multiplicative Complexity of n×n-Matrix Multiplication
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On the complexity of the multiplication of matrices of small formats
Journal of Complexity
Beyond the Alder-Strassen bound
Theoretical Computer Science - Automata, languages and programming
Semisimple algebras of almost minimal rank over the reals
Theoretical Computer Science
Group-theoretic lower bounds for the complexity of matrix multiplication
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Semisimple algebras of almost minimal rank over the reals
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.01 |