I re-implemented a quasi-polynomial algorithm. Experimentally, it shows exponential behaviour. Back-of-the-envelope calculation shows this behaviour can continue until the input size is >>10^21 before the asymptotic bound asserts itself. (For comparison, input size 30 is unfeasible)