1.Previous
3.Next

complexity. For example, the arithmetic complexity of the computation of the determinant of a integer matrix is for the usual algorithms (Gaussian elimination). The bit complexity of the same algorithms is exponential in , because the size of the coefficients may grow exponentially during the computation. On the other hand, if these algorithms are coupled with multi-modular arithmetic,

1.Previous
3.Next