Lectures on the Complexity of Bilinear Problems

Description

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.

Keywords

ComputersComputer ScienceInformation TechnologyMachine TheoryProgrammingAlgorithmsMathematicsNumber SystemsProbability & StatisticsStochastic ProcessesNumerical Analysis

1987Book

Author(s)Hans F. de Groote

PublisherSpringer Science & Business Media

ISBN9783540172055

LanguageEnglish

SpringerLink

Similar Books

Book

Computational Complexity of Bilinear Forms: Algebraic Coding Theory and Applications to Digital Communication Systems (Lecture Notes in Control and Information Sciences, 94)