Abstract
The basic problem is the following: We have a finite set Χ = {x 1,...,x n} and we want to identify an unknown el-ement x i of Χ testing some subset A of Χ whether A contains x i or not.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1972 Springer-Verlag Wien
About this chapter
Cite this chapter
Katona, G. (1972). Introduction. In: Combinatorial Search Problems. International Centre for Mechanical Sciences, vol 145. Springer, Vienna. https://doi.org/10.1007/978-3-7091-4317-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-7091-4317-9_1
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81169-6
Online ISBN: 978-3-7091-4317-9
eBook Packages: Springer Book Archive