Solving the generalized Subset Sum problem with a light based device

Recently, a number of researchers have suggested light-based devices to solve combinatorially interesting problems. In this paper, we design a light based device to solve a generalized version of the Subset Sum problem which was previously handled by Oltean and Muntean. We further design a system which is capable of providing us with the solution subset of the problem in addition to the YES/NO answer to the question of whether there exists a solution or not.

[1]  Mihai Oltean,et al.  Light-based string matching , 2009, Natural Computing.

[2]  Jerome Faist.  Optoelectronics: Silicon shines on , 2005, Nature.

[3]  Alexander Fang,et al.  An all-silicon Raman laser , 2005, Nature.

[4]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[5]  M. Paniccia,et al.  A continuous-wave Raman silicon laser , 2005, Nature.

[6]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[7]  Mihai Oltean,et al.  Exact Cover with Light , 2007, New Generation Computing.

[8]  Dror G. Feitelson.  Optical computing - a survey for computer scientists , 1988 .

[9]  Tien D. Kieu,et al.  Quantum Algorithm for Hilbert's Tenth Problem , 2001, ArXiv.

[10]  Mohammad Sohel Rahman,et al.  An Optical Solution for the Subset Sum Problem , 2009, IWNC.

[11]  Selmer Bringsjord,et al.  P=np , 2004, ArXiv.

[12]  B. Dickinson,et al.  The complexity of analog computation , 1986 .

[13]  J H Reif,et al.  Efficient parallel algorithms for optical computing with the discrete Fourier transform (DFT) primitive. , 1997, Applied optics.

[14]  Joseph W. Goodman,et al.  Architectural development of optical data processing systems , 1982 .

[15]  M. Panicia,et al.  The silicon solution [silicon photonics] , 2005, IEEE Spectrum.

[16]  Mihai Oltean,et al.  Solving the Hamiltonian path problem with a light-based computer , 2007, Natural Computing.

[17]  Scott Aaronson,et al.  NP-complete Problems and Physical Reality , 2005, Electron. Colloquium Comput. Complex..

[18]  Thomas J. Naughton,et al.  Implementations of a Model of Physical Sorting , 2008, Int. J. Unconv. Comput..

[19]  Dominik Schultes.  Rainbow Sort: Sorting at the Speed of Light , 2004, Natural Computing.

[20]  Mohammad Sohel Rahman,et al.  Computing a Solution for the Subset Sum Problem with a Light Based Device , 2009, OSC.

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  Mihai Oltean,et al.  Solving the subset-sum problem with a light-based device , 2007, Natural Computing.