Lower bounds of the complexity of linear algebras (Q1259163): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(79)90107-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2036897928 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4166226 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algebras Having Linear Multiplicative Complexities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some elementary proofs of lower bounds in complexity theory / rank | |||
Normal rank |
Latest revision as of 01:36, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lower bounds of the complexity of linear algebras |
scientific article |
Statements
Lower bounds of the complexity of linear algebras (English)
0 references
1979
0 references
Algebraic Complexity
0 references
Bilinear Forms
0 references
Tensor Rank
0 references
Multiplicative Complexity
0 references
Residual Algorithm
0 references
Zero-Divisor Free Algebras
0 references
Fiduccia- Zalcstein Conjecture
0 references