Bilinear mincing rank (Q1115593)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bilinear mincing rank |
scientific article |
Statements
Bilinear mincing rank (English)
0 references
1988
0 references
A bilinear form f can always be computed by bilinear straightline algorithms. The minimal length of such an algorithm is called the bilinear circuit size of f. In this paper, the ``mincing rank'' of bilinear forms over fields of characteristic zero is defined (too complex to be repeated here). The mincing rank of a bilinear form f which is a purely algebraic-combinatoric notion turns out to be a lower bound on the bilinear circuit size complexity of f. It is expected to yield nontrivial linear bounds for specific forms of interest.
0 references
lower bound on bilinear circuit size
0 references
mincing rank
0 references
bilinear forms
0 references