Concrete Multiplicative Complexity of Symmetric Functions

DOI10.1007/11821069_16MaRDI QIDQ5756689zbMATH OpenOpenAlexWikidataFDO

Authors René Peralta, Joan Boyar

Publication date 5 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11821069_16

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Tight bounds for the multiplicative complexity of symmetric functions
• scientific article; zbMATH DE number 165425
• On the complexity of symmetric polynomials
• Upper bounds on the multiplicative complexity of symmetric Boolean functions
• scientific article; zbMATH DE number 18630
• Patterns and complexity of multiplicative functions
• scientific article; zbMATH DE number 4047091
• On the complexity of multiplication in the Iwahori-Hecke algebra of the symmetric group
• scientific article; zbMATH DE number 4108848
• Multiplicative complexity of polynomial multiplication over finite fields

Cited in

(8)

• On hardware implementation of Tang-maitra Boolean functions
• Hilbert function and complexity lower bounds for symmetric Boolean functions
• Differential uniformity and linearity of S-boxes by multiplicative complexity
• scientific article; zbMATH DE number 4209604 (Why is no real title available?)
• scientific article; zbMATH DE number 176874 (Why is no real title available?)
• scientific article; zbMATH DE number 3894982 (Why is no real title available?)
• De Bruijn sequences and complexity of symmetric functions
• Tight bounds for the multiplicative complexity of symmetric functions

This page was built for publication: Concrete Multiplicative Complexity of Symmetric Functions

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