Performance bounds on the splitting algorithm for binary testing

From MaRDI portal

Revision as of 15:58, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1393276

Jump to:navigation, search

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 (6)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1393276&oldid=13551391"