Optical solution for bounded NP-complete problems.

@article{Shaked2007OpticalSF,
  title={Optical solution for bounded NP-complete problems.},
  author={N. Shaked and St{\'e}phane Messika and S. Dolev and Joseph Rosen},
  journal={Applied optics},
  year={2007},
  volume={46 5},
  pages={
          711-24
        }
}
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… Expand
Optical processor for solving the traveling salesman problem (TSP)
Masking traveling beams: Optical solutions for NP-complete problems, trading space for time
An optical solution for the traveling salesman problem.
An Optical Wavelength-Based Solution to the 3-SAT Problem
An Optical Solution for the SAT Problem
Light-based solution for the dominating set problem.
An optical solution for the set splitting problem
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 22 REFERENCES
Optical Computing: An Introduction
Introduction to Fourier optics
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
The Traveling Salesman
  • G. Reinelt
  • Computer Science
  • Lecture Notes in Computer Science
  • 1994
Signal detection by complex spatial filtering
  • A. Lugt
  • Computer Science
  • IEEE Trans. Inf. Theory
  • 1964
...
1
2
3
...