Before revision:  Their algorithm runs in time n^{ O (\log^3 n)}, where t is assumed to be a ~ constant.
After revision:  Their algorithm runs in time n^{ O (\log^3 n)}, where t is assumed to be a constant.