✦ LIBER ✦

Lower bounds for algebraic complexity of nilpotent associative algebras

✍ Scribed by A. V. Leont’ev

Publisher: Springer US
Year: 2010
Tongue: English
Weight: 134 KB
Volume: 169
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-010-0065-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for the bilinear complexity

Lower bounds for the bilinear complexity of associative algebras

✍ M. Bläser 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 395 KB

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.

Lower bounds for algebraic decision tree

Lower bounds for algebraic decision trees

✍ J Michael Steele; Andrew C Yao 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 445 KB

Strong bisimilarity of simple process al

✍ Jiří Srba 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 284 KB

Lower bounds for commutative radical Ban

Lower bounds for commutative radical Banach algebras

✍ Marc P Thomas 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 438 KB

Triangular representations of nilpotent

Triangular representations of nilpotent graded associative algebras

✍ N. G. Nesterenko 📂 Article 📅 1988 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 536 KB