Optical matrix manipulation techniques for search problems
M. W. Haney, R. A. Athale · Annual Meeting Optical Society of America · 1988
Tree search and graph matching problems are ubiquitous in artificial intelligence. Applications areas include scheduling, theorem proving, and scene labeling/interpretation for computer vision. In general these problems have exponential time complexity and become intractable rapidly as the number of variables grow.