𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds for the bilinear complexity of associative algebras

✍ Scribed by M. Bläser

Publisher
Springer
Year
2000
Tongue
English
Weight
395 KB
Volume
9
Category
Article
ISSN
1016-3328

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity Lower Bounds for Approximatio
Complexity Lower Bounds for Approximation Algebraic Computation Trees
✍ Felipe Cucker; Dima Grigoriev 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 159 KB

We prove lower bounds for approximate computations of piecewise polynomial functions which, in particular, apply for round-off computations of such functions.

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