39 citations · 72 across the 3 of their papers we have counts for
Showing cs.ARShow all
2 papers · 1 filter
cs.AR2007★ 39 cited
Solving the subset-sum problem with a light-based device
Mihai Oltean, Oana Muntean
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 fol…
cs.AR2007★ 25 cited
Exact Cover with light
Mihai Oltean, Oana Muntean
We suggest a new optical solution for solving the YES/NO version of the Exact Cover problem by using the massive parallelism of light. The idea is to build an optical device which…