Galactic algorithm

A galactic algorithm is an algorithm with record-breaking theoretical (asymptotic) performance, but which is not used due to practical constraints. Typical reasons are that the performance gains only appear for problems that are so large they never occur, or the algorithm's complexity outweighs a relatively small gain in performance. Galactic algorithms were so named by Richard Lipton and Ken Regan,^[1] because they will never be used on any data sets on Earth.

^ Lipton, Richard J.; Regan, Kenneth W. (2013). "David Johnson: Galactic Algorithms". People, Problems, and Proofs: Essays from Gödel's Lost Letter: 2010. Heidelberg: Springer Berlin. pp. 109–112. ISBN 9783642414220.

[seminal-1] Lipton, Richard J.; Regan, Kenneth W. (2013). "David Johnson: Galactic Algorithms". People, Problems, and Proofs: Essays from Gödel's Lost Letter: 2010. Heidelberg: Springer Berlin. pp. 109–112. ISBN 9783642414220.

[1]