Performance bounds on the splitting algorithm for binary testing

DOI10.1007/BF00263588zbMath0276.68023OpenAlexW2061143573MaRDI QIDQ1393276

Ronald L. Graham, Michael R. Garey

Publication date: 1974

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00263588

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Related Items

Sequential testing of complex systems: a review, Decision tree design by simulated annealing, A unifying framework for trie design heuristics, The game of \(N\) questions of a tree, Performances of an algorithm constructing a nearly optimal binary tree, Coping with known patterns of lies in a search game