Noun
time complexity (usually uncountable, plural time complexities)
(computer science) the amount of time an algorithm requires to run, as a function of the amount of input, measured in such a way as to ignore constant terms and multiplication by constant terms