1979
DOI: 10.1016/0024-3795(79)90026-0
|View full text |Cite
|
Sign up to set email alerts
|

On the maximal multiplicative complexity of a family of bilinear forms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
28
0

Year Published

1985
1985
2014
2014

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 34 publications
(29 citation statements)
references
References 5 publications
1
28
0
Order By: Relevance
“…The bound cannot be improved in general. The structure of the proof of the theorem relies on an idea contained in [2], as will be clarified in Section 3.…”
Section: Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…The bound cannot be improved in general. The structure of the proof of the theorem relies on an idea contained in [2], as will be clarified in Section 3.…”
Section: Resultsmentioning
confidence: 99%
“…It was shown in [2] that the statement is true when the ground field is the field of the complex numbers. The proof exploits in a crucial way both the separability properties and the algebraic closeness of C. The interest in Statement 1 is mainly justified by the following proposition.…”
Section: Generalizationsmentioning
confidence: 99%
See 3 more Smart Citations