✦ LIBER ✦

O(n2.7799) complexity for n × n approximate matrix multiplication

✍ Scribed by Dario Bini; Milvio Capovani; Francesco Romani; Grazia Lotti

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The N2O×N2O, N2O×SO2, and (N2O)2×SO2 van

✍ H. Valdes; J. A. Sordo 📂 Article 📅 2004 🏛 John Wiley and Sons ⚖ 50 KB 👁 1 views

An O(n2) algorithm for the maximum cycle

✍ P. Butkovic; R.A. Cuninghame-Green 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 503 KB

Derivation of an O(k2 log n) algorithm f

✍ Alberto Pettorossi 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 838 KB

The evaluation of matrix elements for no

✍ Hai-lun Lin 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 662 KB

The evaluation of matrix elements for no

✍ Hai-Lun Lin 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 373 KB

The evaluation of matrix elements for no

✍ Hai-Lun Lin 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 434 KB