A new light-based solution to the Hamiltonian path problem

The exponential running time for algorithms designed to solve NP-complete problems in conventional computers, mostly, makes it almost impossible solving large instances of such problems in reasonable time.?Unconventional computers may be the answer to this problem.?In this paper we use light to solve a Hamiltonian path problem in polynomial time.?At first, the solution space of the problem is generated and then invalid solutions are eliminated from it. Our approach is based on filters which remove paths that are not Hamiltonian from the set of possible solutions. We perform polynomial preprocessing steps to produce the filters and find Hamiltonian paths of a graph based on the rays of light passing through them.?Finally we report the design of filters and use light to solve the Hamiltonian path problem. Highlights? In this paper we use a light-based way to solve the Hamiltonian path problem. ? Our solution is based on designing filters which remove invalid Hamiltonian paths. ? Totally, our solution is done in two phases preprocessing and processing. ? The time complexity of the solution is polynomial. ? The resource consumption complexity of the solution is still exponential.

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

[2]  Lila Kari.  DNA computing in vitro and in vivo , 2001, Future Gener. Comput. Syst..

[3]  Albert Y. Zomaya,et al.  Parallel computing problems and nature-inspired solutions , 2001, Future Gener. Comput. Syst..

[4]  Robert F. Love,et al.  Heuristic for the Hamiltonian Path Problem in Euclidian Two Space , 1979 .

[5]  Leslie G. Valiant,et al.  Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[6]  Shlomi Dolev,et al.  Masking traveling beams: Optical solutions for NP-complete problems, trading space for time , 2010, Theor. Comput. Sci..

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

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

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

[10]  Toyohiko Yatagai.  Optical computing in Japan , 1988, Future Gener. Comput. Syst..

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

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

[13]  Constantine Katsinis.  Merging, sorting and matrix operations on the SOME-Bus multiprocessor architecture , 2004, Future Gener. Comput. Syst..

[14]  Gerald L. Thompson,et al.  A successful algorithm for the undirected Hamiltonian path problem , 1985, Discret. Appl. Math..

[15]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[16]  Frank Rubin,et al.  A Search Procedure for Hamilton Paths and Circuits , 1974, JACM.

[17]  Mohammad Sohel Rahman,et al.  Solving the generalized Subset Sum problem with a light based device , 2010, Natural Computing.

[18]  Saeed Jalili,et al.  An Optical Wavelength-Based Solution to the 3-SAT Problem , 2009, OSC.

[19]  Scott Aaronson,et al.  Guest Column: NP-complete problems and physical reality , 2005, SIGA.

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

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

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

[23]  Minyi Guo,et al.  Towards solution of the set-splitting problem on gel-based DNA computing , 2004, Future Gener. Comput. Syst..

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

[25]  Brian S. Wherrett,et al.  Optical components for digital optical circuits , 1987, Future Gener. Comput. Syst..