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 ?
(29), then the cyclic-shifted sequences [mathematical expression not reproducible] are recovered, and the computational complexity for this step is 2LN CAs.
In summary, the totally computational complexity of the proposed MU algorithm is O([N.sub.BS][U.sup.2] + [U.sup.3]).
The computational complexity of the MBS detector is reduced by pruning the branches, whose accumulated metric is larger than or equal to [[rho].sub.[OMEGA]].
In general, the computational complexity of the proposed algorithm is similar to OMP when the signal sparsity is small.
Then, the parameter estimation could be implemented in the low-dimensional space-time beamspace with a dramatically reduced computational complexity.
A practical CMFD algorithm should have a relatively low computational complexity in addition to maintaining a certain degree of accuracy.
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.
It has been observed that PDASP scheme exhibits much lesser computational complexity and processing time parallely than the sequentially operated Kalman and RLS algorithms.
TABLE 1: Computational complexity of different estimators.
Estimating the CCM and getting its inversion are the two main steps of aggravating the computational complexity in STAP.
Traditional SOC estimation algorithms such as open-circuit voltage method and AH counting method have low computational complexity, but SOC estimation accuracy of these algorithms is low and cannot meet the requirements of battery equalization management.

Full browser ?