Pages that link to "Item:Q1087014"
From MaRDI portal
The following pages link to Lectures on the complexity of bilinear problems (Q1087014):
Displaying 22 items.
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method (Q432769) (← links)
- On the rank of certain finite fields (Q685719) (← links)
- Semisimple algebras of almost minimal rank over the reals (Q1034526) (← links)
- On a class of primary algebras of minimal rank (Q1063670) (← links)
- A lower bound for the border rank of a bilinear map (Q1088760) (← links)
- Bilinear mincing rank (Q1115593) (← links)
- Communication complexity of multi-processor systems (Q1118403) (← links)
- On the order of approximation in approximative triadic decompositions of tensors (Q1123957) (← links)
- An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\) (Q1177865) (← links)
- Multilinear algebra and parallel programming (Q1186818) (← links)
- Efficient randomized generation of optimal algorithms for multiplication in certain finite fields (Q1198957) (← links)
- On the direct sum conjecture in the straight line model (Q1265137) (← links)
- Multiplicative complexity of direct sums of quadratic systems (Q1347225) (← links)
- Semi-algebraic complexity -- Additive complexity of matrix computational tasks (Q1361878) (← links)
- On the complexity of the multiplication of matrices of small formats (Q1394936) (← links)
- The complexity of bivariate power series arithmetic. (Q1401232) (← links)
- Beyond the Alder-Strassen bound. (Q1770421) (← links)
- Complexity and geometry of bilinear maps (Q1781226) (← links)
- Improved method for finding optimal formulas for bilinear maps in a finite field (Q2272384) (← links)
- Maximal bilinear complexity and codes (Q2638779) (← links)
- The border rank of the multiplication of $2\times 2$ matrices is seven (Q3376942) (← links)
- (Q6076152) (← links)
