Performance bounds on the splitting algorithm for binary testing

DOI10.1007/BF00263588MaRDI QIDQ1393276zbMATH OpenOpenAlexFDO

Authors M. R. Garey, Ron Graham

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)

Cited in

(7)

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

This page was built for publication: Performance bounds on the splitting algorithm for binary testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1393276)