TY - JOUR
T1 - Masking traveling beams
T2 - Optical solutions for NP-complete problems, trading space for time
AU - Dolev, Shlomi
AU - Fitoussi, Hen
N1 - Funding Information:
We would like to acknowledge Nati Shaked, Ido Leshem and Shay Shapira for assisting with the laboratory experiment. The authors were partially supported by the Lynne and William Frankel Center for Computer Science and the Rita Altura Trust Chair in Computer Science.
PY - 2010/2/6
Y1 - 2010/2/6
N2 - Two architectures for optical processors designed to solve instances of NP-Complete problems, trading space for time, are suggested. The first approach mimics the traveling salesman by an exponential number of traveling beams, that simultaneously examine the different possible paths. The other approach uses a pre-processing stage in which O (n2) masks consisting of an exponential number of locations, 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 completely blocks the light and accepted otherwise. We present detailed designs for basic primitives of the optical processor. We propose designs for solving instances of Hamiltonian path, Traveling Salesman, Clique, Independent Set, Vertex Cover, Partition, 3-SAT, 3D-matching, and the Permanent.
AB - Two architectures for optical processors designed to solve instances of NP-Complete problems, trading space for time, are suggested. The first approach mimics the traveling salesman by an exponential number of traveling beams, that simultaneously examine the different possible paths. The other approach uses a pre-processing stage in which O (n2) masks consisting of an exponential number of locations, 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 completely blocks the light and accepted otherwise. We present detailed designs for basic primitives of the optical processor. We propose designs for solving instances of Hamiltonian path, Traveling Salesman, Clique, Independent Set, Vertex Cover, Partition, 3-SAT, 3D-matching, and the Permanent.
KW - NP-complete problems
KW - Optical computing
UR - http://www.scopus.com/inward/record.url?scp=74149088298&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2009.06.030
DO - 10.1016/j.tcs.2009.06.030
M3 - Article
AN - SCOPUS:74149088298
SN - 0304-3975
VL - 411
SP - 837
EP - 853
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 6
ER -