Lines Matching full:complexity
50 2. It minimizes algorithmic complexity.
53 complexity of `O(n^(2*log_2(3)))` (best case) and `O(n^3)` (worst case).
58 a complexity of `O((n*log(n))^log_2(3))` which is favorable to the
67 Its complexity is `O(log(n)*n^2)` as it requires one division per iteration, and
84 to calculate `cos(x)`. It has a complexity of `O(n^3)`.
110 It has a complexity of `O(n^3)`.
133 It has a complexity of `O(n^3)`.
153 to reduce `x` to small enough. It has a complexity of `O(n^3)`.
175 to calculate the bessel when `x < 0`, It has a complexity of `O(n^3)`.
184 exponentiation. The complexity is `O(e*n^2)`, which may initially seem
194 It has a complexity of `O(n^3)` because both `e()` and `l()` do.
271 It has a complexity of `O(n)` because of add.
279 It has a complexity of `O(n)` because of add.
287 It has a complexity of `O(n^3)` because of linear amount of `O(n^2)`
296 It has a complexity of `O(n^3)` because of the division and factorials.
304 It has a complexity of `O(n^3)` because of the division and factorials.
314 It has a complexity of `O(n^3)` because of the division and `l()`.
335 Like square root, its complexity is `O(log(n)*n^2)` as it requires one division
350 It has a complexity of `O(n^4)` because it has a linear number of divisions.
361 It has a complexity of `O(n^4)` because of `gcd()`.
369 It has a complexity of `O(n^3)` because of arctangent.
377 It has a complexity of `O(n^3)` because of sine, cosine, and division.
385 It has a complexity of `O(n^3)` because of arctangent.