In computational complexity theory, the linear search problem is an optimal search problem introduced by Richard E. Bellman and independently considered by Anatole Beck. == The problem == "An immobile hider is located on the real line according to a known probability distribution.
In computational complexity theory, the linear search problem is an optimal search problem introduced by Richard E. Bellman and independently considered by Anatole Beck. == The problem == "An immobile hider is located on the real line according to a known probability distribution.
Source: Wikipedia "Linear search problem" · CC BY-SA 4.0
Share this article: X · Bluesky