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

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

2007-08-14

arxiv.org/abs/0708.1964v1

Computer Science

Hardware Architecture

14 pages, 6 figures, Natural Computing, 2007

Scientific paper

We propose a special 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).

Affiliated with

Also associated with

No associations

Rating

Solving the subset-sum problem with a light-based device does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving the subset-sum problem with a light-based device, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving the subset-sum problem with a light-based device will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-380354