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
Nearly tight bounds on the learnability of evolution
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Beyond the Alder-Strassen bound
Theoretical Computer Science - Automata, languages and programming
On optimal learning algorithms for multiplicity automata
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Hi-index | 0.00 |