G. Simon

Learn More
An optical method for synthesizing a binary matrix representing all feasible solutions of a bounded ͑input length restricted͒ NP-complete combinatorial problem is presented. After the preparation of this matrix, an optical matrix-vector multiplier can be used in order to multiply the synthesized binary matrix and a grayscale vector representing the weights(More)
This paper introduces an optical solution to (bounded-length input instances of) an NP-complete problem called the traveling salesman problem using a pure optical system. The solution is based on the multiplication of a binary-matrix, representing all feasible routes, by a weight-vector, representing the weights of the problem. The multiplication of the(More)
  • 1