تعريف computational complexity في الإنجليزية الإنجليزية القاموس.
Inherent cost of solving a problem in large-scale scientific computation, measured by the number of operations required as well as the amount of memory used and the order in which it is used. The result of a complexity analysis is an estimate of how rapidly the solution time increases as the problem size increases, which can be used to analyze problems and assist in the design of algorithms for their solution