Before revision:  The previously fastest algorithm known for ECP had a runtime of 2^{ O (k^2)}n^{O(1)} [Issac, 2019].
After revision:  The previously fastest algorithm known for ECP had a runtime of 2^{ \mathcal{O (k^2)}n^{O(1)} [Issac, 2019].