[efangs]

Title could also be "Researchers find a better heuristic for a class of exponentially scaling problems."

There's no claim to have changed the complexity class, so"exponentially faster" just means the problem is still exponentially in problem size, but the exponent is smaller.

From the looks of it, though, it is a nice result because it has pretty wide applicability.

[voidmain]

No, "exponentially faster" means exponentially faster with exponentially more hardware. Specifically, N processors can solve a problem of size N in O(log N) wall clock time, where the previous (serial) algorithm used O(N) wall clock time. Most programmers would say "more scalable" or "more parallel" rather than "faster", but the terminology makes sense and is standard in the context of the PRAM model of parallel computation.

I'm not sure, but I doubt this algorithm is "faster" than the previous one on a single processor.

(The article is drivel; I couldn't figure out what they were talking about either, until I looked at the paper)

[efangs]

Ah ok, yeah TBH I didn't read the article, but was guessing from the headline this is what they meant since in exponentially scaling problems theres always room at the top (unless explicitly proven otherwise).