Abstract
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that simultaneously examine the different possible paths. The other approach uses a pre-processing stage in which O(n 2) masks are constructed, each representing a different edge in the graph. The choice and combination of the appropriate (small) subset of these masks yields the solution. The solution is rejected in cases where the combination of these masks totally blocks the light and accepted otherwise. We present detailed designs for basic primitives of the optical processor. We propose designs for solving Hamiltonian path, Traveling Salesman, Clique, Independent Set, Vertex Cover, Partition, 3-SAT, and 3D-matching.
Partially supported by the Lynne and William Frankel Center for Computer Science and the Rita Altura Trust Chair in Computer Science.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dolev, S., Korach, E., Uzan, G.: A Method for Encryption and Decryption of Messages. PCT Patent Application WO 2006/001006 (January 2006)
Dolev, S., Yuval, N.: Optical implementation of bounded non-deterministic Turing machines. US Patent 7,130,093 B2 (October 2006)
Dolev, S., Fitoussi, H.: The Traveling Beams: Optical Solutions for Bounded NP-Complete Problems. Technical report #07–04, Ben Gurion University of the Negev (January 2007)
Feitelson, G.: Optical Computing: A Survey for Computer Scientists. MIT Press, Cambridge (1988)
Garey, M.R., Johnson, D.S.: Computers and Intractability, a guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco (1979)
Hyman, A.: Charles Babbage: Pioneer of the Computer. Princeton University Press, Princeton (1982)
Kochavi, Z.: Switching and finite automata theory. McGraw-Hill, New York (1978)
Lenslet LTD, http://www.hpcwire.com/hpcwire/hpcwireWWW/03/1017/106185.html
McAulay, A.D.: Optical computer architectures. John Wiley, Chichester (1991)
Rong, H., Liu, A., Jones, R., Cohen, O., Hak, D., Nicolaescu, R., Fang, A., Paniccia, M.: An all-sillicon Raman laser. Nature 433, 292–294 (2005)
Reif, J.H., Tygar, D., Yoshida, A.: The Computability and Complexity of Optical Beam Tracing. In: 31st Annual IEEE Symposium on Foundations of Computer Science, The Computability and Complexity of Ray Tracing. Discrete and Computational Geometry, vol. 11, pp. 265–287. IEEE, Los Alamitos (1994)
Shaked, N.T., Messika, S., Dolev, S., Rosen, J.: Optical Solution for Bounded NP-Complete Problems. Journal of Applied Optics 46(5), 711–724 (2007)
Shamir, A.: Factoring Large Numbers with the TWINKLE device. In: Koç, Ç.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 2–12. Springer, Heidelberg (1999)
Shamir, A., Tromer, E.: Factoring Large Numbers with the TWIRL Device. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 1–26. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Dolev, S., Fitoussi, H. (2007). The Traveling Beams Optical Solutions for Bounded NP-Complete Problems . In: Crescenzi, P., Prencipe, G., Pucci, G. (eds) Fun with Algorithms. FUN 2007. Lecture Notes in Computer Science, vol 4475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72914-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-72914-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72913-6
Online ISBN: 978-3-540-72914-3
eBook Packages: Computer ScienceComputer Science (R0)