Complexity function

English

Noun

1. Template:Lb A function that counts the number of distinct factors (substrings of consecutive symbols) in a string of symbols;
   Template:Lb a function that counts the number of words of a given length.
   • Template:Quote-book
   • 2003, Julien Cassaigne, Constructing Infinite Words of Intermediate Complexity, Masami Ito, Masafumi Toyama (editors), Developments in Language Theory: 6th International Conference, 6th International Conference, DLT 2002, Revised Papers, Springer, Template:W 2450, page 173,

     We present two constructions of infinite words with a complexity function that grows faster than any polynomial, but slower than any exponential.

2. Template:Lb A function representing the computational complexity an algorithm.
   • 2003, Roberto Segala, Verification of Randomized Distributed Algorithms, Ed Brinksma, Holger Hermanns, Joost-Pieter Katoen (editors), Lectures on Formal Methods and Performance Analysis, Springer, Template:W 2090, page 253,

     Let $\varphi$ be a complexity function.

   • 2011, Richard Neapolitan, Kumarss Naimipour, Foundations of Algorithms, 4th Edition, Jones & Bartlett Publishers, page 31,

     A complexity function need not have a quadratic term to be in $O(n^2)$. It need only eventually lie beneath some pure quadratic function on a graph. Therefore, any logarithmic or linear complexity function is in $O(n^2)$.

   • 2014, R. Panneerselvam, Research Methodology, 2nd Edition, PHI Learning, page 512,

     Hence, the worst case time complexity function of Floyd's algorithm is $O(n^3)$.

Derived terms

• Template:L
• Template:L
• Template:L
• Template:L

Translations

• French: Template:T-needed
• German: Template:T
• Italian: Template:T-needed

• French: Template:T-needed
• German: Template:T
• Italian: Template:T-needed

• French: Template:T-needed
• German: Template:T
• Italian: Template:T-needed

Further reading

• Template:Pedia
• Template:Pedia
• Template:Pedia