Solving the subset-sum problem with a light-based device

@article{Oltean2007SolvingTS,
  title={Solving the subset-sum problem with a light-based device},
  author={M. Oltean and O. Muntean},
  journal={Natural Computing},
  year={2007},
  volume={8},
  pages={321-331}
}
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… Expand
OPTICAL SOLUTIONS FOR THE UNBOUNDED SUBSET-SUM PROBLEM
Solving the minimum hitting set problem with a light-based device
Computing a Solution for the Subset Sum Problem with a Light Based Device
An optical solution for the set splitting problem
An Optical Solution for the Subset Sum Problem
An Optical Solution for the SAT Problem
Solving the generalized Subset Sum problem with a light based device
Masking traveling beams: Optical solutions for NP-complete problems, trading space for time
...
1
2
3
4
...

References

SHOWING 1-10 OF 48 REFERENCES
Solving the Hamiltonian path problem with a light-based computer
  • M. Oltean
  • Computer Science, Mathematics
  • Natural Computing
  • 2007
An optical solution for the traveling salesman problem.
Optical solution for bounded NP-complete problems.
Rainbow Sort: Sorting at the Speed of Light
Efficient parallel algorithms for optical computing with the discrete Fourier transform (DFT) primitive.
Model of computation for Fourier optical processors
  • T. Naughton
  • Computer Science, Engineering
  • International Topical Meeting on Optics in Computing
  • 2000
Stationary pulses of light in an atomic medium
An all-silicon Raman laser
...
1
2
3
4
5
...