The complexity of analog computation
Mathematics and Computers in Simulation
Optical components for digital optical circuits
Future Generation Computer Systems
Future Generation Computer Systems
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
A Search Procedure for Hamilton Paths and Circuits
Journal of the ACM (JACM)
DNA computing in vitro and in vivo
Future Generation Computer Systems - Special issue on particle based modelling methods applied in biology
Merging, sorting and matrix operations on the SOME-bus multiprocessor architecture
Future Generation Computer Systems - Special issue: Advanced services for clusters and internet computing
Towards solution of the set-splitting problem on gel-based DNA computing
Future Generation Computer Systems - Special issue: Computational chemistry and molecular dynamics
Guest Column: NP-complete problems and physical reality
ACM SIGACT News
Solving the Hamiltonian path problem with a light-based computer
Natural Computing: an international journal
Solving the subset-sum problem with a light-based device
Natural Computing: an international journal
An Optical Wavelength-Based Solution to the 3-SAT Problem
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
Solving the generalized Subset Sum problem with a light based device
Natural Computing: an international journal
| Hi-index | 0.00 |
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.