𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs

✍ Scribed by Michael D. Hirsch


Publisher
Springer
Year
1991
Tongue
English
Weight
687 KB
Volume
1
Category
Article
ISSN
1016-3328

No coin nor oath required. For personal study only.