How inefficient can a sort algorithm be?
Abstract
We find large lower bounds for a certain family of algorithms, and prove that such bounds are limited only by natural computability arguments.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.