Linear search problem
Snapshot
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In computational complexity theory , the linear search problem is an optimal search problem introduced by Richard E. Bellman and independently considered by Anatole Beck.
In computational complexity theory , the linear search problem is an optimal search problem introduced by Richard E. Bellman and independently considered by Anatole Beck.
See also
Linear search Search games
Text derived from https://en.wikipedia.org/w/index.php?oldid=1291106107 under CC BY-SA 4.0; modifications have been made.