e-COMPUTABLE FORMS AND THE STRASSEN CONJECTURE
2015
In this paper we introduce the notion of e-computability as a method of finding the Waring rank of forms. We use this notion to find infin- itely many new examples which satisfy Strassen's Conjecture.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
10
References
4
Citations
NaN
KQI