Linear search problem

In computational complexity theory, the linear search problem is an optimal search problem introduced by Richard E. Bellman[1] and independently considered by Anatole Beck.[2][3][4]

  1. ^ Bellman, Richard (July 1963), "Problem 63-9, An Optimal Search", SIAM Review, 5 (3): 274, JSTOR 2027629
  2. ^ Beck, Anatole (December 1964), "On the linear search Problem", Israel Journal of Mathematics, 2: 221–228, doi:10.1007/BF02759737
  3. ^ Beck, Anatole (June 1965), "More on the linear search problem", Israel Journal of Mathematics, 3: 61–70, doi:10.1007/BF02760028
  4. ^ Beck, Anatole; Beck, Micah (December 1986), "The linear search problem rides again", Israel Journal of Mathematics, 53: 365–372, doi:10.1007/BF02786568