Proceedings of the American Mathematical Society

			Journals Home Search Author Info Subscribe Tech Support Help
ISSN 1088-6826 (e) ISSN 0002-9939 (p)

Previous issue \| Table of contents \| Next issue Articles in press \| Recently posted articles \| Most recent issue \| All issues Previous Article \| Next Article

The cost of computing integers

Author(s): W. de Melo; B. F. Svaiter
Journal: Proc. Amer. Math. Soc. 124 (1996), 1377-1378.
MSC (1991): Primary 11N56, 11A25, 11Y16
Retrieve article in: PDF
This article is available free of charge

Abstract | References | Similar articles | Additional information

Abstract: We analyse the growth rate of a number theoretic function related to the operational complexity of integers

References:

[SS]: M. Shub and S. Smale, On the Intractability of Hilbert's Nullestellensatz and an algebraic version of `` $NP \ne P$ ?'', preprint.
[BSS]: L. Blum, M. Shub, and S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. 21 (1989), 1--46. MR 90a:68022


	Comments: webmaster@ams.org © Copyright 2009, American Mathematical Society Privacy Statement		Search the AMS