Natan T Shaked1, Stephane Messika, Shlomi Dolev
1Ben-Gurion University of the Negev, Israel. natis@ee.bgu.a.cil
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
Researchers developed a novel optical method to solve complex combinatorial problems like the traveling salesman problem (TSP). This approach uses optical matrix-vector multiplication for faster computation, validated by simulations and experiments.
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: