The Traveling Beams Optical Solutions for Bounded NP-Complete Problems

(Extended Abstract)
  • Shlomi Dolev
  • Hen Fitoussi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4475)


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.


Transition Relation Vertex Cover Hamiltonian Path Input Graph Partial Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Dolev, S., Korach, E., Uzan, G.: A Method for Encryption and Decryption of Messages. PCT Patent Application WO 2006/001006 (January 2006)Google Scholar
  2. 2.
    Dolev, S., Yuval, N.: Optical implementation of bounded non-deterministic Turing machines. US Patent 7,130,093 B2 (October 2006)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Feitelson, G.: Optical Computing: A Survey for Computer Scientists. MIT Press, Cambridge (1988)Google Scholar
  5. 5.
    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)zbMATHGoogle Scholar
  6. 6.
    Hyman, A.: Charles Babbage: Pioneer of the Computer. Princeton University Press, Princeton (1982)zbMATHGoogle Scholar
  7. 7.
    Kochavi, Z.: Switching and finite automata theory. McGraw-Hill, New York (1978)Google Scholar
  8. 8.
  9. 9.
    McAulay, A.D.: Optical computer architectures. John Wiley, Chichester (1991)Google Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)CrossRefGoogle Scholar
  13. 13.
    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)CrossRefGoogle Scholar
  14. 14.
    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)CrossRefGoogle Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Shlomi Dolev
    • 1
  • Hen Fitoussi
    • 1
  1. 1.Department of Computer Science, Ben-Gurion University of the NegevIsrael

Personalised recommendations