Optical binary-matrix synthesis for solving bounded NP-complete combinatorial problems-Reference-Cited by-同舟云学术

Optical binary-matrix synthesis for solving bounded NP-complete combinatorial problems

Published:2007-10-01 Issue:10 Volume:46 Page:108201
ISSN:0091-3286
Container-title:Optical Engineering
language:en
Short-container-title:Opt. Eng

Author:

Tabib Tal

Publisher

SPIE-Intl Soc Optical Eng

Subject

General Engineering,Atomic and Molecular Physics, and Optics

Reference12 articles.

1. M. R. Garey and D. S. Johnson ,Computers and Intractability. A Guide to the Theory of NP-completeness, W. H. Freeman and Company, New York (1979).

2. 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,” inProc. 20th Annual Conf. on Computational Complexity (CCC), IEEE (2005). Longer version available on the Web at http://www.cs.tau.ac.il/amnon/Papers/GST.cc05.journal.ps.

3. Optical solution for bounded NP-complete problems

4. J. W. Goodman ,Introduction to Fourier Optics, 2nd ed., pp. 282–289, McGraw-Hill, New York (1996).

5. A. D. McAulay ,Optical Computer Architectures: the Application of Optical Concepts to Next Generation Computers, pp. 289–299, Wiley, New York (1991).

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A 2-dimensional optical architecture for solving Hamiltonian path problem based on micro ring resonators;Optics & Laser Technology;2015-01

2. A parallel optical implementation of arithmetic operations;Optics & Laser Technology;2013-07

3. Design and experimental verification for optical module of optical vector–matrix multiplier;Applied Optics;2013-06-20

4. Light-based solution for the dominating set problem;Applied Optics;2012-10-05

5. Parallel decomposition of combinatorial optimization problems using electro-optical vector by matrix multiplication architecture;The Journal of Supercomputing;2010-11-26