To be fair, there is a pretty strong correlation between a problem being in BPP and being efficiently solvable in practice.

There are some exceptions of course (graph isomorphism was solved in practice when the best theoretical algorithms were still exponential) but in general once people find a n^100000 algorithm it soon turns into a n^3 algorithm with reasonable coefficients.

It's efficient, but somewhat slow..