✦ LIBER ✦

Algebraic complexity of the computation of a pair of bilinear forms

✍ Scribed by D. Yu. Grigor'ev

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimum computation of p bilinear forms

✍ Jean-Claude Lafon 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 637 KB

On a bilinear form on the universal enve

✍ N. N. Shapovalov 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 395 KB

On the maximal multiplicative complexity

✍ M.D. Atkinson; N.M. Stephens 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 498 KB

Trace identities of the Jordan algebra o

✍ S. Yu. Vasilovskii 📂 Article 📅 1992 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 336 KB

Complexity of computation on real algebr

✍ Marie-Françoise Roy†; Aviva Szpirglas‡ 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 670 KB

A Complete Characterization of the Algeb

✍ Bläser, Markus 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 267 KB