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

Computer algebraic treatment of complex word problems

โœ Scribed by Heinz Schumann

Book ID
107530970
Publisher
Springer-Verlag
Year
1997
Tongue
English
Weight
195 KB
Volume
29
Category
Article
ISSN
1863-9690

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Text Editing of Algebraic Word Problems
Text Editing of Algebraic Word Problems
โœ Low, Renae; Over, Ray ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 766 KB
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)=