๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the computational complexity of the solution of linear systems with moduli

โœ Scribed by Anatoly V. Lakeyev

Publisher
Springer
Year
1996
Tongue
English
Weight
413 KB
Volume
2
Category
Article
ISSN
1385-3139

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The computational complexity of the reli
The computational complexity of the reliability problem on distributed systems
โœ Min-Sheng Lin; Deng-Jyi Chen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 450 KB

The reliability of a distributed program in a distributed computing system is the probability that a program which runs on multiple processing elements and needs to communicate with other processing elements for remote data files will be executed successfully. This reliability varies according to (

The Computational Complexity of Some Pro
The Computational Complexity of Some Problems of Linear Algebra
โœ Jonathan F Buss; Gudmund S Frandsen; Jeffrey O Shallit ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 330 KB

We consider the computational complexity of some problems dealing with matrix rank. Let E, S be subsets of a commutative ring R. Let x 1 , x 2 , ..., x t be variables. Given a matrix M=M(x 1 , x 2 , ..., x t ) with entries chosen from E \_ [x 1 , x 2 , ..., x t ], we want to determine maxrank S (M)=