complexity function
名词 n.
英文释义
名词 n.
-
A function that counts the number of distinct factors (substrings of consecutive symbols) in a string of symbols;
— It follows that #92;bullet The length function l#58;A#42;#92;longrightarrow#92;mathcalN is a complexity function on A#42;.
- 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.
-
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.
词形变化
0 次浏览
数据来源: Wiktionary