The phrase "a computational complexity of" is correct and usable in written English.
It can be used when discussing the difficulty or resource requirements of an algorithm or computational problem.
Example: "The algorithm has a computational complexity of O(n log n), making it efficient for large datasets."
Alternatives: "a complexity level of" or "a computational cost of".
Then the corresponding discrete-time differentiator is simply a K-tap digital finite impulse response filtera with a computational complexity of K complex multiply-and-add (CMAD) for each decoded bit d ^ A, n or d ^ B, n.
The computation of the eigendecomposition of A∗ has a computational complexity of 𝒪(N).
In a context-sensitive network with n genes and k contexts, however, a (2 n ∙ k) × (2 n ∙ k) [ 23] (or 2 n × 2 n [ 20]) matrix is required for an accurate (or approximate) analysis of the SSD; this results in a computational complexity of O nk22n) (or O nk2 n )) for an accurate (or approximate) computation of the STM.
Consequent structure exploitation yields a computational complexity of O PN), where N is the number of unknowns.
Its main features are no wavetable and a computational complexity of only one multiply per sample when amplitude and frequency are constant.
Typically, Gaussian process is very slow with a computational complexity of typically n3 where n is the number of data points.
These reductions will characterize the approximability of SBC and MLSBC from a computational complexity point of view.
These conditions are feasible from a computational complexity point of view.
Here presented method has a computational complexity (C.C) of O ( M s. D 2 ).
From a computational complexity point of view, the main drawback with existing techniques is that they perform much computation during each iteration of the algorithm.
This results in a reduction of computational complexity of complex-valued adaptive filters by a half, while providing enhanced physical insight and control over complex-valued estimation algorithms.
