scientific article; zbMATH DE number 165425

MaRDI QIDQ4033227zbMATH OpenFDO

Authors M. V. Mikhajlyuk

Publication date 16 May 1993

zbMATH Keywords

elementary symmetric functionsfinite ringlinear complexity

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) General theory of numerical analysis in abstract spaces (65J05) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Arithmetic complexity in ring extensions
• How symmetric can a function be?
• Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications
• Symmetric Functions, m-Sets, and Galois Groups
• On symmetric polynomials

Cited in

(13)

• How symmetric can a function be?
• Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
• The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
• Arithmetic complexity in ring extensions
• On the complexity of a class of circuits consisting of multipole functional elements.
• scientific article; zbMATH DE number 5849341 (Why is no real title available?)
• scientific article; zbMATH DE number 4209604 (Why is no real title available?)
• Bit complexity of breaking and achieving symmetry in chains and rings
• scientific article; zbMATH DE number 3968581 (Why is no real title available?)
• scientific article; zbMATH DE number 176874 (Why is no real title available?)
• Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications
• Concrete Multiplicative Complexity of Symmetric Functions
• Tight bounds for the multiplicative complexity of symmetric functions

This page was built for publication:

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