Sorting sums of binary decision summands
Abstract
A sum where each of the N summands can be independently chosen from two choices yields 2N possible summation outcomes. There is an O(K2)-algorithm that finds the K smallest/largest of these sums by evading the enumeration of all sums.
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.