The following pages link to (Q4047029):
Displaying 50 items.
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics (Q1240771) (← links)
- The complexity of vector-products (Q1243128) (← links)
- Some elementary proofs of lower bounds in complexity theory (Q1245277) (← links)
- On the optimal evaluation of a set of bilinear forms (Q1245572) (← links)
- Global properties of tensor rank (Q1250855) (← links)
- On the direct sum conjecture in the straight line model (Q1265137) (← links)
- Multiplicative complexity of direct sums of quadratic systems (Q1347225) (← links)
- Lower bounds for diophantine approximations (Q1358914) (← links)
- Parallel evaluation of arithmetic circuits (Q1365929) (← links)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- Lower bounds for polynomial evaluation and interpolation problems (Q1386175) (← links)
- The complexity of bivariate power series arithmetic. (Q1401232) (← links)
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
- On the algebraic complexity of some families of coloured Tutte polynomials (Q1433009) (← links)
- Effective equidimensional decomposition of affine varieties (Q1602652) (← links)
- On semiring complexity of Schur polynomials (Q1630378) (← links)
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← links)
- On Comon's and Strassen's conjectures (Q1634665) (← links)
- A note on the simultaneous Waring rank of monomials (Q1670791) (← links)
- Sparse resultants and straight-line programs (Q1690776) (← links)
- Multiplicative complexity of vector valued Boolean functions (Q1704580) (← links)
- Fast structured matrix computations: tensor rank and Cohn-Umans method (Q1704813) (← links)
- Bounds on the tensor rank (Q1756466) (← links)
- Beyond the Alder-Strassen bound. (Q1770421) (← links)
- Fast and efficient parallel solution of dense linear systems (Q1825589) (← links)
- Functional programming concepts and straight-line programs in computer algebra (Q1849848) (← links)
- High-order lifting and integrality certification (Q1878491) (← links)
- Ranks of tensors and a generalization of secant varieties (Q1931761) (← links)
- Block tensors and symmetric embeddings (Q1931772) (← links)
- Deformation techniques for efficient polynomial equation solving. (Q1977143) (← links)
- Tensor slice rank and Cayley's first hyperdeterminant (Q2093514) (← links)
- A note on VNP-completeness and border complexity (Q2122788) (← links)
- Quadratic lower bounds for algebraic branching programs and formulas (Q2159469) (← links)
- The \(G\)-stable rank for tensors and the cap set problem (Q2166199) (← links)
- On computing reciprocals of power series (Q2265255) (← links)
- Operator scaling: theory and applications (Q2309517) (← links)
- Grothendieck constant is norm of Strassen matrix multiplication tensor (Q2334621) (← links)
- The Hitchhiker guide to: secant varieties and tensor decomposition (Q2337279) (← links)
- Progress on the symmetric Strassen conjecture (Q2341528) (← links)
- On the number of multiplications needed to invert a monic power series over fields of characteristic two (Q2387412) (← links)
- Abelian tensors (Q2398420) (← links)
- P-RAM vs. RP-RAM (Q2402257) (← links)
- Computing multihomogeneous resultants using straight-line programs (Q2457419) (← links)
- Real roots of univariate polynomials and straight line programs (Q2466010) (← links)
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten (Q2557099) (← links)
- Berechnung und Programm. I (Q2557558) (← links)
- Maximal bilinear complexity and codes (Q2638779) (← links)
- Boolean circuits versus arithmetic circuits (Q2639101) (← links)
- Geometric conditions for strict submultiplicativity of rank and border rank (Q2662176) (← links)
- On sets of linear forms of maximal complexity (Q2680709) (← links)
