The traveling beams optical solutions for bounded NP-complete problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4475 LNCS, Issue , 2007, Pages 120-134

  Dolev, Shlomi ^a   Fitoussi, Hen ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; HAMILTONIANS; PROGRAM PROCESSORS; SET THEORY;

BOUNDED INSTANCES; OPTICAL PROCESSORS; OPTICAL SOLUTIONS; PREPROCESSING STAGES;

COMPUTER ARCHITECTURE;

EID: 35148872010     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72914-3_12     Document Type: Conference Paper

References (14)

1. Dolev, S., Korach, E., Uzan, G.: A Method for Encryption and Decryption of Messages. PCT Patent Application WO 2006/001006 (January 2006)
2. Dolev, S., Yuval, N.: Optical implementation of bounded non-deterministic Turing machines. US Patent 7,130,093 B2, (October 2006)
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)
4. Feitelson, G.: Optical Computing: A Survey for Computer Scientists. MIT Press, Cambridge (1988)
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)
6. Hyman, A.: Charles Babbage: Pioneer of the Computer. Princeton University Press, Princeton (1982)
7. Kochavi, Z.: Switching and finite automata theory. McGraw-Hill, New York (1978)
8. Lenslet LTD. http://www.hpcwire.com/hpcwire/hpcwireWWW/03/1017/106185. html
9. McAulay, A.D.: Optical computer architectures. John Wiley, Chichester (1991)
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)
11. Reif, J.H., Tygar, D., Yoshida, A.: The Computability and Complexity of Optical Beam Tracing, 31st Annual IEEE Symposium on Foundations of Computer Science, The Computability and Complexity of Ray Tracing. Discrete and Computational Geometry 11, 265-287 (1994)
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)
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)
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)