On some generalizations of binary search
暂无分享，去创建一个
Classic binary search is extended to multidimensional search problems. These new search methods can efficiently solve several important problems of computer science. Applications of these results to an open problem in the theory of computation are discussed yielding new insight into the Lba problem.
[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[2] Robert F. Sproull,et al. Principles in interactive computer graphics , 1973 .
[3] Ellis Horowitz,et al. Computing Partitions with Applications to the Knapsack Problem , 1974, JACM.