Optical solution for bounded NP-complete problems

Applied Optics

Volumn 46, Issue 5, 2007, Pages 711-724

  Shaked, Natan T ^a,b   Messika, Stephane ^a,b   Dolev, Shlomi ^a,b   Rosen, Joseph ^a,b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b Department of Electrical and Computer Engineering ^*

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTER SIMULATION; MATRIX ALGEBRA; OPTICAL CORRELATION; TRAVELING SALESMAN PROBLEM; VECTORS;

BINARY MATRIX; GRAY-SCALE VECTORS; NP-COMPLETE COMBINATORIAL PROBLEMS;

PROBLEM SOLVING;

EID: 33947146306     PISSN: 1559128X     EISSN: 15394522     Source Type: Journal    
DOI: 10.1364/AO.46.000711     Document Type: Article

References (15)

1. D. Harel, Algorithmics: The Spirit of Computing (Addison-Wesley, 1987).
2. G. Reinelt, The Traveling Salesman: Computational Solutions for TSP Applications (Springer-Verlag, 1994).
3. J. E. Mitchell, "Branch-and-cut algorithms for combinatorial optimization problems," in Handbook of Applied Optimization (Oxford U. Press, 2002), pp. 65-77.
4. K. A. Smith, "Neural networks for combinatorial optimization: a review of more than a decade of research," INFORMS J. Comput. 11, 15-34 (1999).
5. N. Collings, R. Sumi, K. J. Weible, B. Acklin, and W. Xue, "The use of optical hardware to find good solutions of the travelling salesman problem (TSP)," in Proc. SPIE 1806, 637-641 (1993).
6. D. Gutfreund, R. Shaltiel, and A. Ta-Shma, "If NP languages are hard on the worst-case then it is easy to find their hard instances," in Proceedings of the 20th Annual Conference on Computational Complexity (CCC) (2005). A long version of this paper is available on the web at http://www.cs.tau.ac.il/~amnon/Papers/GST.cc05.journal.ps.
7. J. W. Goodman, Introduction to Fourier Optics, 2nd ed. (McGraw-Hill, 1996), pp. 232-246.
8. C. S. Weaver and J. W. Goodman, "A technique for optically convolving two functions," Appl. Opt. 5, 1248-1249 (1966).
9. A. VanderLugt, "Signal detection by complex spatial filtering," IEEE Trans. Inf. Theory IT-10, 139-145 (1964).
10. A. Homaifar, S. Guan, and G. E. Liepins, "Schema analysis of the traveling salesman problem using genetic algorithms," Complex Syst. 6, 183-217 (1992).
11. D. G. Feitelson, Optical Computing: A Survey for Computer Scientists (MIT Press, 1988), pp. 148-163.
12. M. A. Karim and A. A. S. Awwal, Optical Computing: An Introduction (Wiley, 1992), pp. 328-356.
13. J. W. Goodman, Introduction to Fourier Optics, 2nd ed. (McGraw-Hill, 1996), pp. 282-289.
14. A. D. McAulay, Optical Computer Architectures: The Application of Optical Concepts to Next Generation Computers (Wiley, 1991), pp. 289-299.
15. S. Dolev, E. Korach, and G. Uzan, "A method for encryption and decryption of messages," PCT patent application WO 2006/001006 (5 January 2006).