-
1
-
-
0001245248
-
On the algorithmic complexity of associative algebras
-
A. Alder, and V. Strassen On the algorithmic complexity of associative algebras Theoret. Comput. Sci. 15 1981 201 211
-
(1981)
Theoret. Comput. Sci.
, vol.15
, pp. 201-211
-
-
Alder, A.1
Strassen, V.2
-
3
-
-
0040531570
-
Lower bounds for the multiplicative complexity of matrix multiplication
-
M. Bläser Lower bounds for the multiplicative complexity of matrix multiplication Comput. Complexity 8 1999 203 226
-
(1999)
Comput. Complexity
, vol.8
, pp. 203-226
-
-
Bläser, M.1
-
6
-
-
0034557785
-
Lower bounds for the bilinear complexity of associative algebras
-
M. Bläser Lower bounds for the bilinear complexity of associative algebras Comput. Complexity 9 2000 73 112
-
(2000)
Comput. Complexity
, vol.9
, pp. 73-112
-
-
Bläser, M.1
-
7
-
-
15744389986
-
2-lower bound for the multiplicative complexity of n×n-matrix multiplication
-
Proc. 18th Internat. GI-MIMD Symp. on Theoretical Aspects of Computer Science (STACS)
-
M. Bläser, A 5 2 n 2 -lower bound for the multiplicative complexity of n × n -matrix multiplication, in: Proc. 18th Internat. GI-MIMD Symp. on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science, vol. 2010, 2001, pp. 99-110.
-
(2001)
Lecture Notes in Computer Science
, vol.2010
, pp. 99-110
-
-
Bläser, M.1
-
8
-
-
23044527978
-
Improvements of the Alder-Strassen bound: Algebras with nonzero radical
-
Proc. 28th Internat. EATCS Colloquium on Automata, Languages, and Programming (ICALP)
-
M. Bläser, Improvements of the Alder-Strassen bound: algebras with nonzero radical, in: Proc. 28th Internat. EATCS Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science 2076, 2001, pp. 79-91.
-
(2001)
Lecture Notes in Computer Science
, vol.2076
, pp. 79-91
-
-
Bläser, M.1
-
9
-
-
0037463546
-
The complexity of bivariate power series arithmetic
-
M. Bläser The complexity of bivariate power series arithmetic Theoret. Comput. Sci. 295 2003 65 83
-
(2003)
Theoret. Comput. Sci.
, vol.295
, pp. 65-83
-
-
Bläser, M.1
-
10
-
-
0002125925
-
On the optimal evaluation of a set of bilinear forms
-
R.W. Brockett, and D. Dobkin On the optimal evaluation of a set of bilinear forms Linear Algebra Appl. 19 1978 207 235
-
(1978)
Linear Algebra Appl.
, vol.19
, pp. 207-235
-
-
Brockett, R.W.1
Dobkin, D.2
-
11
-
-
0024715662
-
A lower bound for matrix multiplication
-
N.H. Bshouty A lower bound for matrix multiplication SIAM J. Comput. 18 1989 759 765
-
(1989)
SIAM J. Comput.
, vol.18
, pp. 759-765
-
-
Bshouty, N.H.1
-
14
-
-
85023205150
-
Matrix multiplication via arithmetic progression
-
D. Coppersmith, and S. Winograd Matrix multiplication via arithmetic progression J. Symbolic Comput. 9 1990 251 280
-
(1990)
J. Symbolic Comput.
, vol.9
, pp. 251-280
-
-
Coppersmith, D.1
Winograd, S.2
-
16
-
-
0009616563
-
Characterization of division algebras of minimal rank and the structure of their algorithm varieties
-
H.F. de Groote Characterization of division algebras of minimal rank and the structure of their algorithm varieties SIAM J. Comput. 12 1983 101 117
-
(1983)
SIAM J. Comput.
, vol.12
, pp. 101-117
-
-
De Groote, H.F.1
-
17
-
-
0004116402
-
Lectures on the complexity of bilinear problems
-
Springer, Berlin
-
H.F. de Groote, Lectures on the Complexity of Bilinear Problems, Lecture Notes in Computer Science, vol. 245, Springer, Berlin, 1986.
-
(1986)
Lecture Notes in Computer Science
, vol.245
-
-
De Groote, H.F.1
-
18
-
-
84974699592
-
On associative algebras of minimal rank
-
Proc. Second Applied Algebra and Error Correcting Codes Conference (AAECC) Springer, Berlin
-
J. Heintz, J. Morgenstern, On associative algebras of minimal rank, in: Proc. Second Applied Algebra and Error Correcting Codes Conference (AAECC), Lecture Notes in Computer Science, vol. 228, Springer, Berlin, 1986, pp. 1-24.
-
(1986)
Lecture Notes in Computer Science
, vol.228
, pp. 1-24
-
-
Heintz, J.1
Morgenstern, J.2
-
19
-
-
0040597497
-
On the complexity of bilinear forms with commutativity
-
J. Ja'Ja' On the complexity of bilinear forms with commutativity SIAM J. Comput. 9 1980 717 738
-
(1980)
SIAM J. Comput.
, vol.9
, pp. 717-738
-
-
Ja'Ja, J.1
-
20
-
-
0006669808
-
A lower bound for the multiplicative complexity of the product of two matrices
-
Centre de Calcul de L'Esplanade, U.E.R. de Mathematique, University of Louis Pasteur, Strasbourg, France
-
J.-C. Lafon, S. Winograd, A lower bound for the multiplicative complexity of the product of two matrices, Tech. Report, Centre de Calcul de L'Esplanade, U.E.R. de Mathematique, University of Louis Pasteur, Strasbourg, France, 1978.
-
(1978)
Tech. Report
-
-
Lafon, J.-C.1
Winograd, S.2
-
21
-
-
0000238829
-
Methods for computing values of polynomials
-
V.Y. Pan Methods for computing values of polynomials Russian Math. Surveys 21 1966 105 136
-
(1966)
Russian Math. Surveys
, vol.21
, pp. 105-136
-
-
Pan, V.Y.1
-
22
-
-
0013069009
-
Partial and total matrix multiplication
-
A. Schönhage Partial and total matrix multiplication SIAM J. Comput. 10 1981 434 455
-
(1981)
SIAM J. Comput.
, vol.10
, pp. 434-455
-
-
Schönhage, A.1
-
24
-
-
34250487811
-
Gaussian elimination is not optimal
-
V. Strassen Gaussian elimination is not optimal Numer. Math. 13 1969 354 356
-
(1969)
Numer. Math.
, vol.13
, pp. 354-356
-
-
Strassen, V.1
-
25
-
-
84961475121
-
Vermeidung von Divisionen
-
V. Strassen Vermeidung von Divisionen J. Reine Angew. Math. 264 1973 184 202
-
(1973)
J. Reine Angew. Math.
, vol.264
, pp. 184-202
-
-
Strassen, V.1
-
26
-
-
0039957423
-
Rank and optimal computation of generic tensors
-
V. Strassen Rank and optimal computation of generic tensors Linear Algebra Appl. 52/53 1983 645 685
-
(1983)
Linear Algebra Appl.
, vol.52-53
, pp. 645-685
-
-
Strassen, V.1
-
27
-
-
84943702783
-
Relative bilinear complexity and matrix multiplication
-
V. Strassen Relative bilinear complexity and matrix multiplication J. Reine Angew. Math. 375/376 1987 406 443
-
(1987)
J. Reine Angew. Math.
, vol.375-376
, pp. 406-443
-
-
Strassen, V.1
|