On the problem of computational time and complexity of arithmetic functions

DOI10.1145/800169.805441MaRDI QIDQ5402526zbMATH OpenOpenAlexFDO

Authors Algirdas Avižienis

Publication date 14 March 2014

Published in Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Arithmetic functions; related numbers; inversion formulas (11A25) Analytic circuit theory (94C05) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Publication:3033322
• Comparing the combinational complexities of arithmetic functions
• Bounds for parallel addition time of two numbers
• Bit serial addition trees and their applications
• scientific article; zbMATH DE number 4085015

Cited in

(5)

• Characteristic measures of switching functions
• scientific article; zbMATH DE number 1146109 (Why is no real title available?)
• Counting arithmetic formulas
• Some characterizations of functions computable in on-line arithmetic
• scientific article; zbMATH DE number 1148334 (Why is no real title available?)

This page was built for publication: On the problem of computational time and complexity of arithmetic functions

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