The phrase "and consequently the complexity" is correct and usable in written English.
It can be used to indicate that one thing leads to another, specifically in relation to an increase or change in complexity.
Example: "The new regulations are more stringent, and consequently the complexity of compliance has increased significantly."
Alternatives: "and thus the complexity" or "and as a result, the complexity".
This problem becomes more evident in a mixture pdf, where the number of parameters to be estimated increases, and consequently the computational complexity and the time needed for convergence increase as well.
The cost data are the same in all three approaches, of course, but how the data are processed and evaluated are different, and consequently, the resultant complexity factor values will also be different (Fig. 18).
It can be noticed from Section 3-D that when grouping at each receiver all the invariants parameters of the channel into one 1 × ρn t vector (respectively one ρn t × n r matrix), the size of the codebook required to achieve full multiplexing gain is very large, and consequently the search complexity of the optimal vector (respectively matrix) in the codebook becomes very high.
In order to reduce the EST sequence redundancy and consequently the time complexity of the process, the sequences were processed using CD-HIT [ 52] prior to database formatting.
In both cases, POBN will favor reducing the number of regulators for each gene and consequently reducing the complexity of the model with little or no impact on the model's ability to predict the observed gene expression data even when the exact reason for the disconnection cannot be distinguished.
U i can be in multiple groups at the same time (≈3 times in Fig. 3) which improves the speed of malicious user detection, reduces the learning phase duration, and consequently reduces the complexity of IPMCD.
Fluxomers combine flux variables with isotopomer variables and consequently reduce the complexity and nonlinearity of the original isotopomer balance equations.
But, in the following, we show that ⟨ N'⟩ is only in O(N/m k +1) and consequently the average-case time complexity of the algorithm is astonishingly O(N), under the assumption that P follows the random-walk model and k = O(1).
