On asymptotic estimates for arithmetic cost functions

DOI10.1090/S0002-9939-97-03583-1MaRDI QIDQ4332956zbMATHOpenAlexFDO

Authors C. Moreira

Publication date 19 February 1997

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/s0002-9939-97-03583-1

zbMATH Keywords

complexityasymptotic estimatesarithmetical functionsarithmetic cost functionscomputing integerscost of polynomialsobtainability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other combinatorial number theory (11B75) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• The cost of computing integers
• scientific article; zbMATH DE number 7663176
• Arithmetic complexity
• Valiant's model and the cost of computing integers
• Counting arithmetic formulas

Cites work

• scientific article; zbMATH DE number 4112009 (Why is no real title available?)
• On the intractability of Hilbert's Nullstellensatz and an algebraic version of ``\(NP\neq P\)?
• The cost of computing integers

Cited in

(7)

• Counting arithmetic formulas
• Separable asymptotic cost of evaluating elementary functions
• scientific article; zbMATH DE number 7663176 (Why is no real title available?)
• On solving univariate sparse polynomials in logarithmic time
• On the intractability of Hilbert's Nullstellensatz and an algebraic version of ``\(NP\neq P\)?
• Algebraic complexity classes
• On the asymptotic behaviour of the Aragón Artacho-Campoy algorithm

This page was built for publication: On asymptotic estimates for arithmetic cost functions

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