The complexity of analog computation
Mathematics and Computers in Simulation
Optical computing: a survey for computer scientists
Optical computing: a survey for computer scientists
Introduction to algorithms
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Guest Column: NP-complete problems and physical reality
ACM SIGACT News
An optical model of computation
Theoretical Computer Science
Rainbow Sort: Sorting at the Speed of Light
Natural Computing: an international journal
Solving the Hamiltonian path problem with a light-based computer
Natural Computing: an international journal
A light-based device for solving the hamiltonian path problem
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Ultrafast Digital-Optical Arithmetic Using Wave-Optical Computing
OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
Solving NP-Complete Problems with Delayed Signals: An Overview of Current Research Directions
OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
Optical Designs for Non-deterministic Turing Machines
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
Evolutionary Design of Graph-Based Structures for Optical Computing
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
Computing a Solution for the Subset Sum Problem with a Light Based Device
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
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
OSC'10 Proceedings of the Third international conference on Optical supercomputing
Solving a generalized version of the exact cover problem with a light-based device
OSC'10 Proceedings of the Third international conference on Optical supercomputing
An optical solution for the SAT Problem
OSC'10 Proceedings of the Third international conference on Optical supercomputing
Nanotechnology based optical solution for NP-hard problems
OSC'10 Proceedings of the Third international conference on Optical supercomputing
A new light-based solution to the Hamiltonian path problem
Future Generation Computer Systems
| Hi-index | 0.00 |
We propose an optical computational device which uses light rays for solving the subset-sum problem. The device has a graph-like representation and the light is traversing it by following the routes given by the connections between nodes. The nodes are connected by arcs in a special way which lets us to generate all possible subsets of the given set. To each arc we assign either a number from the given set or a predefined constant. When the light is passing through an arc it is delayed by the amount of time indicated by the number placed in that arc. At the destination node we will check if there is a ray whose total delay is equal to the target value of the subset sum problem (plus some constants). The proposed optical solution solves a NP-complete problem in time proportional with the target sum, but requires an exponential amount of energy.