Galactic algorithm: Difference between revisions

Revision as of 19:14, 24 September 2022

Revision as of 02:31, 2 October 2022

Line 1:

{{Short description|Classification of algorithm}}

A '''galactic algorithm''' is one that outperforms any other algorithm for problems that are sufficiently large, but where "sufficiently large" is so big that the algorithm is never used in practice. Galactic algorithms were so named by [[Richard Lipton]] and Ken Regan,<ref name="seminal">{{cite book |author=Lipton, Richard J., and Kenneth W. Regan |chapter=David Johnson: Galactic Algorithms |title=People, Problems, and Proofs |publisher=Springer Berlin |___location=Heidelberg |year=2013 |pages=109–112 |chapter-url=https://rjlipton.wordpress.com/2010/10/23/galactic-algorithms/}}</ref> as they will never be used on any of the merely terrestrial data sets we find here on Earth.

== Possible use cases ==