complexity function
短语词形变化
释义与例句
-
1.
A function that counts the number of distinct factors (substrings of consecutive symbols) in a string of symbols;
计算机 工程 数学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, LNCS 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.
A function that counts the number of distinct factors (substrings of consecutive symbols) in a string of symbols; (of a formal language) a function that counts the number of words of a given length.
a function that counts the number of words of a given length.
计算机 工程 数学 -
3.
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, LNCS 2090, page 253, Let ϕ be a complexity function.