✦ LIBER ✦

A note on compressed sensing and the complexity of matrix multiplication

✍ Scribed by M.A. Iwen; C.V. Spencer

Book ID: 108154613
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 141 KB
Volume: 109
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2009.01.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of some algorithms of

On the complexity of some algorithms of matrix multiplication

✍ Valery B Alekseyev 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 712 KB

On the additive complexity of 2 × 2 matr

On the additive complexity of 2 × 2 matrix multiplication

✍ Nader H. Bshouty 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 349 KB

The bit-operation complexity of matrix m

The bit-operation complexity of matrix multiplication and of all pair shortest path problem

✍ V.Ya. Pan 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 623 KB

A Note on the Combinatorics of Multiplic

A Note on the Combinatorics of Multiplication in Groups

✍ A. Juhász; A. Leibman 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 111 KB

Let S be a finite subset of a group G, |S| = n, and let g ∈ S • S. Then g induces a partial function λ g : S → S by λ g (s) = t if and only if st = g and λ g (s) is not defined if g ∈ sS. For every g ∈ S • S, λ g is a one-to-one mapping. In this note we describe the groups which have a finite genera

A note on the complexity of program eval

A note on the complexity of program evaluation

✍ Oscar H. Ibarra; Brian S. Leininger; Louis E. Rosier 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 846 KB

A note on the complex semi-definite matr

A note on the complex semi-definite matrix Procrustes problem

✍ J. Kiskiras; G. D. Halikias 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB