Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that simultaneously examine the different possible paths. The other approach uses a pre-processing stage in which O(n2) masks are constructed, each representing a different edge in the graph. The choice and combination of the appropriate (small) subset of these masks yields the solution. The solution is rejected in cases where the combination of these masks totally blocks the light and accepted otherwise. We present detailed designs for basic primitives of the optical processor. We propose designs for solving Hamiltonian path, Traveling Salesman, Clique, Independent Set, Vertex Cover, Partition, 3-SAT, and 3D-matching. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Dolev, S., & Fitoussi, H. (2007). The traveling beams optical solutions for bounded NP-complete problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4475 LNCS, pp. 120–134). Springer Verlag. https://doi.org/10.1007/978-3-540-72914-3_12
Mendeley helps you to discover research relevant for your work.