Lectures on the Complexity of Bilinear Problems - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

6

(FIVE YEARS 0)

H-INDEX

0

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540172055, 9783540473985

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Complexity and rank of finite dimensional associative algebras

Lectures on the Complexity of Bilinear Problems - Lecture Notes in Computer Science ◽

10.1007/bfb0020724 ◽

1987 ◽

pp. 83-110

Keyword(s):

Associative Algebras ◽

Finite Dimensional

Download Full-text

Introduction

Lectures on the Complexity of Bilinear Problems - Lecture Notes in Computer Science ◽

10.1007/bfb0020720 ◽

1987 ◽

pp. 1-6

Download Full-text

Complexity and rank of bilinear mappings

Lectures on the Complexity of Bilinear Problems - Lecture Notes in Computer Science ◽

10.1007/bfb0020721 ◽

1987 ◽

pp. 7-25

Download Full-text

Multiplication of large matrices

Lectures on the Complexity of Bilinear Problems - Lecture Notes in Computer Science ◽

10.1007/bfb0020723 ◽

1987 ◽

pp. 57-82

Download Full-text

Algorithm varieties

Lectures on the Complexity of Bilinear Problems - Lecture Notes in Computer Science ◽

10.1007/bfb0020725 ◽

1987 ◽

pp. 111-128

Download Full-text

Elementary properties of rank and approximate rank of bilinear mappings

Lectures on the Complexity of Bilinear Problems - Lecture Notes in Computer Science ◽

10.1007/bfb0020722 ◽

1987 ◽

pp. 26-56

Download Full-text