๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Coping with errors in binary search procedures

โœ Scribed by R.L. Rivest; A.R. Meyer; D.J. Kleitman; K. Winklmann; J. Spencer

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
561 KB
Volume
20
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal comparison strategies in Ulam's
Optimal comparison strategies in Ulam's searching game with two errors
โœ Daniele Mundici; Alberto Trombetta ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 974 KB

Suppose x is an n-bit integer. By a comparison question we mean a question of the form "does x satisfy either condition a <x< b or c<x<d?". We describe strategies to find x using the smallest possible number q(n) of comparison questions, and allowing up to two of the answers to be erroneous. As pro