Before revision:  The algorithm runs in O(n^{3/2+ \varepsilon }) time, which is a considerable improvement over  previously known algorithms.
After revision:  The algorithm runs in O(n^{3/2+ \epsilon }) time, which is a considerable improvement over previously known algorithms.