The cost of computing integers
HTML articles powered by AMS MathViewer
- by W. de Melo and B. F. Svaiter PDF
- Proc. Amer. Math. Soc. 124 (1996), 1377-1378 Request permission
Abstract:
We analyse the growth rate of a number theoretic function related to the operational complexity of integersReferences
- M. Shub and S. Smale, On the Intractability of Hilbert’s Nullestellensatz and an algebraic version of “$NP \ne P$?”, preprint.
- Lenore Blum, Mike Shub, and Steve Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. (N.S.) 21 (1989), no. 1, 1–46. MR 974426, DOI 10.1090/S0273-0979-1989-15750-9
Additional Information
- W. de Melo
- Affiliation: Instituto de Matematica Pura e Aplicada, Estrada Dona Castorina 110, Jardim Botanico, Rio de Janeiro, Brazil
- Email: demelo@impa.br
- B. F. Svaiter
- Affiliation: Instituto de Matematica Pura e Aplicada, Estrada Dona Castorina 110, Jardim Botanico, Rio de Janeiro, Brazil
- MR Author ID: 304617
- Email: benar@impa.br
- Received by editor(s): May 31, 1994
- Received by editor(s) in revised form: October 24, 1994
- Communicated by: William W. Adams
- © Copyright 1996 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 124 (1996), 1377-1378
- MSC (1991): Primary 11N56, 11A25, 11Y16
- DOI: https://doi.org/10.1090/S0002-9939-96-03173-5
- MathSciNet review: 1307510