Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications

DOI10.1137/S009753970342465XzbMATH Open1052.68151WikidataQ114073916 ScholiaQ114073916MaRDI QIDQ4429698FDOQ4429698

Authors: Vince Grolmusz 

Publication date: 28 September 2003

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Recommendations

• An algorithm for the multiplication of symmetric polynomials
• On the complexity of symmetric polynomials
• A method for computing symmetric and related polynomials
• Computing polynomials with few multiplications
• An extension of elementary symmetric polynomials and power sums to the case of multivariate polynomials
• scientific article; zbMATH DE number 165425
• Elementary Symmetric Polynomials in Numbers of Modulus 1
• Symmetric polynomials over finite fields
• Computing the elementary symmetric polynomials of the multiplier spectra of the maps \(z^2+c\)
• Elementary symmetric polynomials in Shamir's scheme

zbMATH Keywords

arithmetic circuitssymmetric polynomialscomposite modulusalgebraic algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Analytic circuit theory (94C05)

Cited In (8)

• On decompositions of complete hypergraphs
• Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering
• Notes on particular symmetric polynomials with applications
• On the complexities of multipoint evaluation and interpolation
• Elementary symmetric polynomials in Shamir's scheme
• The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4429698)