Comment on Researchers develop the fastest possible flow algorithmparentComments−JohnKemeny2yIf the complexity of an algorithm is 3↑↑64*n^0.999, the algorithm is o(n) but can safely be said to be galactic.* Ps, if memory serves me correct, 3↑↑64 is Graham's number.
Comments
If the complexity of an algorithm is 3↑↑64*n^0.999, the algorithm is o(n) but can safely be said to be galactic.
* Ps, if memory serves me correct, 3↑↑64 is Graham's number.