[phomer]

Yes. Theoretically the algorithm is tractable, but the exponent is so large that it wouldn't be practical to run it in a real environment.

[amelius]

According to the article, the algorithm does not need to have a polynomial bound to be classified as "galactic".

[phomer]

It is mentioned a couple times explicitly, but I think most of the readers for this blog would know that the border line for tractable is polynomial growth. Still, it is an interesting observation, worth investigating.