On the multiplicative complexity of polynomials

DOI10.1515/DMA-2024-0003zbMATH Open1541.68139MaRDI QIDQ6548983FDOQ6548983

Authors: I. S. Sergeev 

Publication date: 3 June 2024

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

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

zbMATH Keywords

arithmetic circuitspolynomialsmultiplicative complexity

Mathematics Subject Classification ID

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

Cites Work

• The complexity of partial derivatives
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
• Partial derivatives in arithmetic complexity and beyond
• The multiplicative complexity of quadratic boolean forms
• Computing polynomials with few multiplications

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)