𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On polychotomous search problems

✍ Scribed by Karl Hinderer; Michael Stieglitz

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
917 KB
Volume
73
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Search problems on graphs
Search problems on graphs
✍ M. Aigner πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 609 KB
On two random search problems
On two random search problems
✍ AndrΓ‘s SebΕ‘ πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 420 KB
Effective Search Problems
Effective Search Problems
✍ Martin Kummer; Frank Stephan πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 734 KB

## Abstract The task of computing a function __F__ with the help of an oracle __X__ can be viewed as a search problem where the cost measure is the number of queries to __X.__ We ask for the minimal number that can be achieved by a suitable choice of __X__ and call this quantity the __query complex