computational complexity


Also found in: Dictionary, Acronyms, Wikipedia.

computational complexity

(algorithm)
The number of steps or arithmetic operations required to solve a computational problem. One of the three kinds of complexity.
References in periodicals archive ?
These mechanisms help reducing the computational complexity by not performing additional unnecessary iterations.
The Blind Turing Machine method used simple homomorphic encryption scheme which reduce the computational complexity of privacy preserving outsourced frequent itemset.
However, this leads to increased utilization of hardware resources and to increased computational complexity.
The computational complexity for the feed-forward ANC system can be divided into three parts: (1) generate reference signal; (2) update controller weights; and (3) generate controller output.
From Table 1, it can be seen that the computational complexity of the proposed hybrid multiuser detector is much lower than that of OMD.
The integrated of HPCL software will be an alternative software system to speed the large sparse computational complexity and optimize the visualization quality for predicting, visualizing and observing some parameter characteristics of the unique combination of rubber nanocomposite to save resources, time consuming and space allocation during the injection molding process and manufacturing the assembled products
Finally, we selected a Huffman coding which gives a high compression ratio with an SNR above 40 dB, and reduces the computational complexity in comparison to the arithmetic coding.
2) With these model order reduction algorithms, we can compute an inexact LU factorization for the MSSS matrix blocks of the saddle-point system in linear computational complexity (O(N)).
At all times, more works in dealing with the ML techniques have been devoted to decomposing the high-dimensional search problem into a sequence of much smaller dimensional search problems, which can drastically reduce their computational complexity and can handle the array of arbitrary geometry [31-34].
Table 1 shows data complexity and computational complexity of a higher-order differential attack on MISTY2 without FLs.

Full browser ?