Before revision:  When applying this algorithm to u \cdot F, where u is uniformly random in the product of unitary groups, the algorithm performs }  (n, \delta) \cdot L (F) \cdot \Gamma(F) \log \Gamma(F) + \log \log \epsilon^{-1 } operations on average.
After revision:  When applying this algorithm to u \cdot F, where u is uniformly random in the product of unitary groups, the algorithm performs \delta} (n, \delta) \cdot L (F) \cdot \Gamma(F) \log \Gamma(F) + \log \log \epsilon^{-1 } operations on average.