The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
- 689 Downloads
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(n 2) 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.
KeywordsTransition Relation Vertex Cover Hamiltonian Path Input Graph Partial Assignment
Unable to display preview. Download preview PDF.
- 1.Dolev, S., Korach, E., Uzan, G.: A Method for Encryption and Decryption of Messages. PCT Patent Application WO 2006/001006 (January 2006)Google Scholar
- 2.Dolev, S., Yuval, N.: Optical implementation of bounded non-deterministic Turing machines. US Patent 7,130,093 B2 (October 2006)Google Scholar
- 3.Dolev, S., Fitoussi, H.: The Traveling Beams: Optical Solutions for Bounded NP-Complete Problems. Technical report #07–04, Ben Gurion University of the Negev (January 2007)Google Scholar
- 4.Feitelson, G.: Optical Computing: A Survey for Computer Scientists. MIT Press, Cambridge (1988)Google Scholar
- 7.Kochavi, Z.: Switching and finite automata theory. McGraw-Hill, New York (1978)Google Scholar
- 9.McAulay, A.D.: Optical computer architectures. John Wiley, Chichester (1991)Google Scholar
- 11.Reif, J.H., Tygar, D., Yoshida, A.: The Computability and Complexity of Optical Beam Tracing. In: 31st Annual IEEE Symposium on Foundations of Computer Science, The Computability and Complexity of Ray Tracing. Discrete and Computational Geometry, vol. 11, pp. 265–287. IEEE, Los Alamitos (1994)Google Scholar