Optimized random chemistry
Abstract
The random chemistry algorithm of Kauffman can be used to determine an unknown subset S of a fixed set V. The algorithm proceeds by zeroing in on S through a succession of nested subsets V=V0,V1,...,Vm=S. In Kauffman's original algorithm, the size of each Vi is chosen to be half the size of Vi-1. In this paper we determine the optimal sequence of sizes so as to minimize the expected run time of the algorithm.
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.