1998 | OriginalPaper | Buchkapitel
Complexity of Computations
verfasst von : Neal Koblitz
Erschienen in: Algebraic Aspects of Cryptography
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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).