Also, remember that while (m) and (m) are referred to as the complexity and expected
complexity of the algorithms any statement about polynomial and exponential
always refer to the asymptotic nature of (m) and (m). A note
of caution is also that these denitions ultimately depend on the denition
of the basic operation. However, to give a stringent denition of this