On the multiplicative complexity of polynomials

DOI10.1515/DMA-2024-0003MaRDI QIDQ6548983zbMATH OpenFDO

Authors I. S. Sergeev

Publication date 3 June 2024

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

zbMATH Keywords

arithmetic circuitspolynomialsmultiplicative complexity

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06)

Recommendations

• Computing polynomials with few multiplications
• scientific article; zbMATH DE number 4033074
• Lower bounds for the complexity of polynomials
• Multiplicative complexity of polynomial multiplication over finite fields
• On parallel evaluation of certain classes of polynomials with an increasing number of variables

Cites work

• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• scientific article; zbMATH DE number 3319974 (Why is no real title available?)
• Computing polynomials with few multiplications
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
• Partial derivatives in arithmetic complexity and beyond
• The complexity of partial derivatives
• The multiplicative complexity of quadratic boolean forms

This page was built for publication: On the multiplicative complexity of polynomials

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