Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten

DOI10.1007/BF01436566zbMath0251.65036OpenAlexW1974331311MaRDI QIDQ2557099

Publication date: 1973

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132187

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to single equations (65H05) Algorithms in computer science (68W99)

Related Items

Affine projections of symmetric polynomials., The complexity of evaluating interpolation polynomials, On semiring complexity of Schur polynomials, A fast numerical algorithm for the composition of power series with complex coefficients, An algebraic approach to approximate evaluation of a polynomial on a set of real points, Polynomial evaluation and interpolation on special sets of points, Quadratic lower bounds for algebraic branching programs and formulas, Feasible arithmetic computations: Valiant's hypothesis, Semi-algebraic decision complexity, the real spectrum, and degree, Straight-line programs in geometric elimination theory, Complexity of computation in finite fields, Lower bounds for polynomial evaluation and interpolation problems, Are there elimination algorithms for the permanent?, On the Power of Homogeneous Depth 4 Arithmetic Circuits, Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits, Multiplicative complexity of vector valued Boolean functions, Unnamed Item, The complexity of partial derivatives, Invariant and geometric aspects of algebraic complexity theory. I, On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\)., Complexity of preprocessing of recursive filters for running in parallel, Entropy of operators or why matrix multiplication is hard for depth-two circuits, Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets, Fast algorithms for elementary operations on complex power series, A Gröbner free alternative for polynomial system solving, Fast modular transforms, Die Berechnungskomplexität der symbolischen Differentiation von Interpolationspolynomen, On the complexities of multipoint evaluation and interpolation, Another polynomial homomorphism, Newton's method and FFT trading, A survey of techniques in applied computational complexity, Fast convolutions meet Montgomery, An elementary proof for Strassen's degree bound, Selection of good algorithms from a family of algorithms for polynomial derivative evaluation, Non-commutative circuits and the sum-of-squares problem, Lower bounds for matrix factorization, Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree, Unnamed Item, A quadratic lower bound for algebraic branching programs, A super-quadratic lower bound for depth four arithmetic circuits, Geometric complexity theory V: Efficient algorithms for Noether normalization, Lower bound for the approximative complexity, Unnamed Item, Berechnung und Programm. I, A quadratic lower bound for homogeneous algebraic branching programs, Lower bounds for matrix factorization, There is no efficient reverse derivation mode for discrete derivatives, Lower bounds in algebraic computational complexity, Definability and fast quantifier elimination in algebraically closed fields, Unifying known lower bounds via geometric complexity theory, On the complexity of skew arithmetic

Cites Work