Comparing the combinational complexities of arithmetic functions

DOI10.1145/42282.214084MaRDI QIDQ3811704zbMATH OpenOpenAlexWikidataFDO

Authors Helmut Alt

Publication date 1988

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/42282.214084

zbMATH Keywords

algebraic functionsBoolean circuitsBoolean complexitynumber-theoretic computations

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to field theory (12-04) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Multiplication is the easiest nontrivial arithmetic function
• Logarithmic Depth Circuits for Algebraic Functions
• scientific article; zbMATH DE number 3999284
• scientific article; zbMATH DE number 4047092
• On fast multiplication of polynomials over arbitrary algebras

Cited in

(6)

• Multiplication is the easiest nontrivial arithmetic function
• Logarithmic Depth Circuits for Algebraic Functions
• scientific article; zbMATH DE number 4047092 (Why is no real title available?)
• scientific article; zbMATH DE number 1979755 (Why is no real title available?)
• On the problem of computational time and complexity of arithmetic functions
• A new minimax theorem for randomized algorithms

This page was built for publication: Comparing the combinational complexities of arithmetic functions

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