Groote, Hans F.

Lectures on the Complexity of Bilinear Problems [electronic resource] / by Hans F. Groote. - Berlin, Heidelberg : Springer Berlin Heidelberg, 1987. - VIII, 140 p. online resource. - Lecture Notes in Computer Science, 245 0302-9743 ; . - Lecture Notes in Computer Science, 245 .

Complexity and rank of bilinear mappings -- Elementary properties of rank and approximate rank of bilinear mappings -- Multiplication of large matrices -- Complexity and rank of finite dimensional associative algebras -- Algorithm varieties.

9783540473985

10.1007/BFb0020719 doi


Computer science.
Computer software.
Numerical analysis.
Computer Science.
Algorithm Analysis and Problem Complexity.
Numerical Analysis.

QA76.9.A43

005.1
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha