The following pages link to (Q4331740):
Displaying 50 items.
- Sparse resultants and straight-line programs (Q1690776) (← links)
- Tensor rank is not multiplicative under the tensor product (Q1698592) (← links)
- Multiplicative complexity of vector valued Boolean functions (Q1704580) (← links)
- Plethysm and fast matrix multiplication (Q1704645) (← links)
- Fast structured matrix computations: tensor rank and Cohn-Umans method (Q1704813) (← links)
- Separation of variables and the computation of Fourier transforms on finite groups. II (Q1704873) (← links)
- On the bit complexity of polynomial system solving (Q1734694) (← links)
- Complexity classes and completeness in algebraic geometry (Q1740570) (← links)
- Typical and admissible ranks over fields (Q1743853) (← links)
- Inverse linear difference operators (Q1746360) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- Polynomial bounds for invariant functions separating orbits (Q1758265) (← links)
- Complexity of multiplication in commutative group algebras over fields of characteristic 0 (Q1759103) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- Essentially optimal computation of the inverse of generic polynomial matrices (Q1763425) (← links)
- Beyond the Alder-Strassen bound. (Q1770421) (← links)
- The efficient computation of Fourier transforms on semisimple algebras (Q1783700) (← links)
- Curves with many points and multiplication complexity in any extension of \(\mathbb{F}_q\) (Q1808846) (← links)
- Lower bounds for dynamic algebraic problems (Q1854488) (← links)
- Ranks of tensors, secant varieties of Segre varieties and fat points (Q1855380) (← links)
- Fast computation of discrete invariants associated to a differential rational mapping (Q1878484) (← links)
- Ranks of tensors and a generalization of secant varieties (Q1931761) (← links)
- About tracing problems in dynamic geometry (Q1943666) (← links)
- Efficient evaluation of specific queries in constraint databases (Q1944172) (← links)
- Small space analogues of Valiant's classes and the limitations of skew formulas (Q1947043) (← links)
- Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
- Deformation techniques for efficient polynomial equation solving. (Q1977143) (← links)
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\). (Q1978699) (← links)
- Cook's versus Valiant's hypothesis (Q1978701) (← links)
- Computational bounds for doing harmonic analysis on permutation modules of finite groups (Q1982599) (← links)
- Conic stability of polynomials and positive maps (Q1996086) (← links)
- Fast computation of generic bivariate resultants (Q1996880) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- On the complexity of computing Kronecker coefficients (Q2012174) (← links)
- On Bézout inequalities for non-homogeneous polynomial ideals (Q2028993) (← links)
- Subquadratic-time algorithms for normal bases (Q2040602) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- Identifiability of rank-3 tensors (Q2050117) (← links)
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets (Q2059797) (← links)
- Rank and border rank of Kronecker powers of tensors and Strassen's laser method (Q2062866) (← links)
- The geometries of Jordan nets and Jordan webs (Q2082727) (← links)
- Almost all subgeneric third-order Chow decompositions are identifiable (Q2088044) (← links)
- Newton-type methods for simultaneous matrix diagonalization (Q2089086) (← links)
- Hermitian K-theory via oriented Gorenstein algebras (Q2100857) (← links)
- The tensor rank of semifields of order 16 and 81 (Q2120920) (← links)
- Computing zero-dimensional tropical varieties via projections (Q2149946) (← links)
- Non-minimum tensor rank Gabidulin codes (Q2154304) (← links)
- The \(G\)-stable rank for tensors and the cap set problem (Q2166199) (← links)
- Computing Riemann-Roch spaces via Puiseux expansions (Q2171940) (← links)
- An introduction to the computational complexity of matrix multiplication (Q2176822) (← links)
