Pages that link to "Item:Q2557099"
From MaRDI portal
The following pages link to Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten (Q2557099):
Displayed 50 items.
- On the complexity of skew arithmetic (Q260085) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- On the complexities of multipoint evaluation and interpolation (Q706626) (← links)
- Definability and fast quantifier elimination in algebraically closed fields (Q798314) (← links)
- Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
- Newton's method and FFT trading (Q979146) (← links)
- Lower bounds in algebraic computational complexity (Q1057648) (← links)
- The complexity of evaluating interpolation polynomials (Q1081273) (← links)
- A fast numerical algorithm for the composition of power series with complex coefficients (Q1095657) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- The complexity of partial derivatives (Q1171380) (← links)
- Invariant and geometric aspects of algebraic complexity theory. I (Q1176389) (← links)
- Complexity of preprocessing of recursive filters for running in parallel (Q1187929) (← links)
- Fast modular transforms (Q1216049) (← links)
- Die Berechnungskomplexität der symbolischen Differentiation von Interpolationspolynomen (Q1218266) (← links)
- Another polynomial homomorphism (Q1219683) (← links)
- A survey of techniques in applied computational complexity (Q1224857) (← links)
- An elementary proof for Strassen's degree bound (Q1240517) (← links)
- Selection of good algorithms from a family of algorithms for polynomial derivative evaluation (Q1248372) (← links)
- Straight-line programs in geometric elimination theory (Q1380007) (← links)
- Lower bounds for polynomial evaluation and interpolation problems (Q1386175) (← links)
- On semiring complexity of Schur polynomials (Q1630378) (← links)
- Multiplicative complexity of vector valued Boolean functions (Q1704580) (← links)
- Lower bound for the approximative complexity (Q1822498) (← links)
- Affine projections of symmetric polynomials. (Q1872730) (← links)
- An algebraic approach to approximate evaluation of a polynomial on a set of real points (Q1899278) (← links)
- Semi-algebraic decision complexity, the real spectrum, and degree (Q1916424) (← links)
- On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\). (Q1978699) (← links)
- Lower bounds for matrix factorization (Q2041242) (← links)
- Quadratic lower bounds for algebraic branching programs and formulas (Q2159469) (← links)
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q2204092) (← links)
- Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree (Q2294435) (← links)
- A quadratic lower bound for homogeneous algebraic branching programs (Q2323359) (← links)
- Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
- Polynomial evaluation and interpolation on special sets of points (Q2387413) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- Berechnung und Programm. I (Q2557558) (← links)
- There is no efficient reverse derivation mode for discrete derivatives (Q2576878) (← links)
- Geometric complexity theory V: Efficient algorithms for Noether normalization (Q2826783) (← links)
- On the Power of Homogeneous Depth 4 Arithmetic Circuits (Q2968157) (← links)
- Fast algorithms for elementary operations on complex power series (Q3586258) (← links)
- Are there elimination algorithms for the permanent? (Q4033465) (← links)
- (Q4612482) (← links)
- A quadratic lower bound for algebraic branching programs (Q5092449) (← links)
- Lower bounds for matrix factorization (Q5092452) (← links)
- A super-quadratic lower bound for depth four arithmetic circuits (Q5092474) (← links)
- (Q5121899) (← links)
- Fast convolutions meet Montgomery (Q5444325) (← links)
- Non-commutative circuits and the sum-of-squares problem (Q5892594) (← links)
- A Gröbner free alternative for polynomial system solving (Q5938584) (← links)