Abstract
Suppose that f(n) and g(n) are functions of the positive integers n which take positive (but not necessarily integer) values for all n. We say that f(n) = 0(g(n)) (or simply f = 0(g)) if there exists a constant C such that f(n) is always less than C · g(n). For example, 2n2 + 3n − 3 = 0(n2) (namely, it is not hard to prove that the left side is always less than 3n2, so 3 can be chosen as the constant C in the definition).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Koblitz, N. (1998). Complexity of Computations. In: Algebraic Aspects of Cryptography. Algorithms and Computation in Mathematics, vol 3. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03642-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-03642-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08332-7
Online ISBN: 978-3-662-03642-6
eBook Packages: Springer Book Archive