The following pages link to (Q4047029):
Displayed 31 items.
- 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)
- 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)
- On computing reciprocals of power series (Q2265255) (← links)
- On the number of multiplications needed to invert a monic power series over fields of characteristic two (Q2387412) (← 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)
- Faster Polynomial Multiplication via Discrete Fourier Transforms (Q3007620) (← links)
- Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication (Q3010380) (← links)
- Faster Combinatorial Algorithms for Determinant and Pfaffian (Q5387794) (← links)
- Non-commutative circuits and the sum-of-squares problem (Q5892594) (← links)
- Algebraic complexities and algebraic curves over finite fields (Q5903919) (← links)
- The communication complexity of enumeration, elimination, and selection (Q5956009) (← links)