Optical solution for bounded NP-complete problems

Natan T. Shaked, Stephane Messika, Shlomi Dolev, Joseph Rosen

Research output: Contribution to journalArticlepeer-review

48 Scopus citations


We present a new optical method for solving bounded (input-length- restricted) NP-complete combinatorial problems. We have chosen to demonstrate the method with an NP-complete problem called the traveling salesman problem (TSP). The power of optics in this method is realized by using a fast matrix-vector multiplication between a binary matrix, representing all feasible TSP tours, and a gray-scale vector, representing the weights among the TSP cities. The multiplication is performed optically by using an optical correlator. To synthesize the initial binary matrix representing all feasible tours, an efficient algorithm is provided. Simulations and experimental results prove the validity of the new method.

Original languageEnglish
Pages (from-to)711-724
Number of pages14
JournalApplied Optics
Issue number5
StatePublished - 10 Feb 2007

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics
  • Engineering (miscellaneous)
  • Electrical and Electronic Engineering


Dive into the research topics of 'Optical solution for bounded NP-complete problems'. Together they form a unique fingerprint.

Cite this