✦ LIBER ✦

Lower bounds for the multiplicative complexity of matrix multiplication

✍ Scribed by M. Bläser

Publisher: Springer
Year: 1999
Tongue: English
Weight: 247 KB
Volume: 8
Category: Article
ISSN: 1016-3328
DOI: 10.1007/s000370050028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sparse matrix vector multiplication on d

Sparse matrix vector multiplication on distributed architectures: Lower bounds and average complexity results

✍ Giovanni Manzini 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 766 KB

On lower bounds for the complexity of po

On lower bounds for the complexity of polynomials and their multiples

✍ W. Baur; K. Halupczok 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 207 KB

Lower bounds for the approximative compl

Lower bounds for the approximative complexity

✍ Bernhard Griesser 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 440 KB

Lower bounds for the complexity of polyn

Lower bounds for the complexity of polynomials

✍ Hans-Jörg Stoß 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 936 KB

Global lower bounds for flow shops with

Global lower bounds for flow shops with multiple processors

✍ D.L. Santos; J.L. Hunsucker; D.E. Deal 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 500 KB

Some Lower Bounds for the Complexity of

Some Lower Bounds for the Complexity of Continuation Methods

✍ Jean-Pierre Dedieu; Steve Smale 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 222 KB

In this note we consider the zero-finding problem for a homogeneous polynomial system, The well-determined (m=n) and underdetermined (m<n) cases are considered together. We also let D=max d i , d=(d 1 , ..., d m ), and The projective Newton method has been introduced by Shub in [6] and is defined