At the same time, the inverse problem of discrete exponentiation is not difficult (it can be computed efficiently using exponentiation by squaring, for example).

These are compared with the true posterior, which can be computed exactly and efficiently using the Viterbi algorithm.

M-splines can be efficiently and stably computed using the following recursions:

Being a power of two, the FFTs of the overlap-add method are computed efficiently.

The fields of feasible computability and computational complexity study functions that can be computed efficiently.

The resultant of two polynomials with rational or polynomial coefficients may be computed efficiently on a computer.

The Pfaffian of this matrix is then computed efficiently using standard determinant algorithms.

As with the arboricity, the pseudoarboricity has a matroid structure allowing it to be computed efficiently .

Also, can be computed efficiently.

Both of these calculations can be computed efficiently using the square-and-multiply algorithm for modular exponentiation.