3 ms·
What about page 4 of [0]: > We remark that, while polynomial, the running time of the algorithm is somewhat abysmal; loose estimates places it somewhere around
by skissane 5y ago
What about page 4 of [0]:
> We remark that, while polynomial, the running time of the algorithm is somewhat abysmal; loose estimates places
it somewhere around O(n^(10^100)); the running time of the algorithm of [RT12] is similar.
I don’t know if that counts as a “real problem”, and I suppose it is only a “loose estimate” too.
[0] https://arxiv.org/pdf/1205.0458v2.pdf https://arxiv.org/pdf/1205.0458v2.pdf
- lisper 5y agoNo, I think that definitely counts as a counterexample. Wow. TIL.