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.
|Original language||English (US)|
|Number of pages||7|
|Journal||Proceedings of the Annual ACM Symposium on Theory of Computing|
|State||Published - Jan 1 1974|
|Event||6th Annual ACM Symposium on Theory of Computing, STOC 1974 - Seattle, United States|
Duration: Apr 30 1974 → May 2 1974
All Science Journal Classification (ASJC) codes