𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bit complexity of matrix products

✍ Scribed by Andrzej Lingas

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
704 KB
Volume
38
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The bit-operation complexity of approxim
The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic
✍ V. Pan πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 330 KB

The approximate evaluation with a given precision of matrix and polynomial products is performed using modular arithmetic. The resulting algorithms are numerically stable. At the same time they are as fast as or faster than the algorithms with arithmetic operations over real or complex numbers.

The bit complexity of the predecessor pr
The bit complexity of the predecessor problem
✍ Y. Afek; M. Cohen; E. Haalman πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 348 KB

A tight bound of 2n -1 bits on the communication complexity of the "predecessor" problem in a synchronous ring (previously known as the "last in a synchronous ring" problem) is presented. @ 1997 Elsevier Science B.V.

The bit complexity of matrix multiplicat
The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented Ξ» algorithms
✍ V.Y. Pan πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 869 KB

The numbers of bit operations (br) required for matrix multiplication (MM), matrix inversion (MI). the evaluation of the determinant of a matrix (Det). and the solution of a system of linear equations (SLE) are estimated from above and below. (For SLE the estimates are nearly sharp.) The bit-complex