The Traveling Beams Optical Solutions for Bounded NP-Complete Problems

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 preprocessing 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.

• Type: Conference
• Year: 2007
• Where: FUN
• Authors: Shlomi Dolev, Hen Fitoussi
• Keywords: Algorithms, FUN 2007, Masks, Optical Processor, Traveling Salesman