Masking traveling beams: Optical solutions for NP-complete problems, trading space for time

Theoretical Computer Science

Volumn 411, Issue 6, 2010, Pages 837-853

  Dolev, Shlomi ^a   Fitoussi, Hen ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

NP complete problems; Optical computing

Indexed keywords

DETAILED DESIGN; EXPONENTIAL NUMBERS; HAMILTONIAN PATH; INDEPENDENT SET; NP COMPLETE PROBLEMS; OPTICAL COMPUTING; OPTICAL PROCESSORS; OPTICAL SOLUTIONS; PRE-PROCESSING; TRAVELING BEAMS; TRAVELING SALESMAN; VERTEX COVER;

COMPUTER ARCHITECTURE; OPTICAL COMMUNICATION; OPTICAL DATA PROCESSING;

POLYNOMIALS;

EID: 74149088298     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.06.030     Document Type: Article

References (38)

1. Caulfield H.J. Space-time complexity in optical computing. SPIE Optical Information-Processing Systems and Architectures II 1347 (1990) 566-572
2. S.A. Cook, The complexity of theorem-proving procedures, in: Proc. of the 3rd Ann. ACM Symp. on Theory of Computing, 1971, pp. 151-158
3. S. Dolev, H. Fitoussi, Primitive operations for graph-optical processor, in: 6th Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms, May 2006
4. S. Dolev, H. Fitoussi, The traveling beams: Optical solutions for bounded NP-Complete problems, Technical Report #07-04, Ben Gurion University of the Negev, January 2007
5. Dolev S., and Fitoussi H. The traveling beams: Optical solutions for bounded NP-complete problems. Proc. of the 4th International Conference on Fun with Algorithms 2007. LNCS vol. 4475 (2007), Springer 120-134
6. S. Dolev, H. Fitoussi, Black boxes and rays, optical solutions for bounded instances of the Hamiltonian path problem, in: 7th Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms, May 2007
7. S. Dolev, I. Leshem, S. Shapira, H. Fitoussi, N.T. Shaked, Optical implementation of a microprocessor for solving the Hamiltonian-path problem, in: The 11th Meeting on Optical Engineering and Science in Israel, OASIS, March 2007
8. S. Dolev, E. Korach, G. Uzan, A Method for Encryption and Decryption of Messages, PCT Patent Application WO 2006/001006, January 2006
9. S. Dolev, N. Yuval, Optical implementation of bounded non-deterministic Turing machines, US Patent 7,130,093 B2, January 2005, field in Israel May 2003
10. M. Dubash, Moore's Law is dead, says Gordon Moore, Techworld 13 April 2005. http://www.techworld.com/opsys/news/index.cfm?NewsID=3477
11. Feige U., and Lund C. On the hardness of computing the permanent of random matrices. Computational Complexity 6 2 (1997) 101-132
12. Feitelson G. Optical Computing: A Survey for Computer Scientists (1988), MIT Press
13. H. Fitoussi, The Traveling Beams: Optical Solutions for Bounded NP-Complete Problems, Summer School on Algorithmic Data Analysis, SADA07, Helsinki, Finland, 2007, Poster Presentation
14. Garey M.R., and Johnson D.S. Computers and Intractability, A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company, San Francisco
15. Goswami D. Optical componenets and storage systems. Resonance 8 6 (2003) 56-71
16. Haist T., and Osten W. An optical solution for the traveling salesman problem. Opt. Express 15 (2007) 10473-10482
17. 5 / 2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2 (1973) 225-231
18. Hyman A. Charles Babbage: Pioneer of the Computer (1982), Princeton University Press
19. Karp R.M. Reducibilty among combinatorial problems. Complexity of Computer Computations (1972) 85-103
20. Kochavi Z. Switching and Finite Automata Theory (1978), McGraw-Hill
21. Lenslet LTD, http://www.hpcwire.com/hpcwire/hpcwireWWW/03/1017/106185.html, use www.archive.org
22. Lipton R. New directions in testing. Distributed Computing and Cryptography. DIMACS Series on Discrete Mathematicsand Theoretical Computer Science vol. 2 (1991), American Mathematical Society 191-202
23. McAulay A.D. Optical Computer Architectures (1991), John Wiley
24. Merkle R.C. Secure communications over insecure channels. Comm. ACM 21 4 (1978) 294299
25. Naughton T.J. A model of computation for Fourier optical processors. Proc. SPIE, Optics Comput. 4089 (2000) 24-34
26. Oltean M. A light-based device for solving the Hamiltonian path problem. In: Calude C., et al. (Ed). Proc. Unconventional Computing. LNCS vol. 4135 (September 2006), Springer-Verlag 217-227
27. Oltean M., and Muntean O. Solving the subset-sum problem with a light-based device. Nat. Comput. 8 2 (2009) 321-331
28. Reif J.H., and Tyagi A. Efficient parallel algorithms for optical computing with discrete Fourier transform (DFT) primitive. Appl. Optics 36 29 (1997) 7327-7340
29. J.H. Reif, D. Tygar, A. Yoshida, The computability and complexity of optical beam tracing, 31st Annual IEEE Symposium on Foundations of Computer Science, 1990, pp. 106-114. Also "The computability and complexity of ray tracing, Discrete Comput. Geom. 11 (1994) 265-287
30. Rong H., Liu A., Jones R., Cohen O., Hak D., Nicolaescu R., Fang A., and Paniccia M. An all-silicon Raman laser. Nature 433 Jan. (2005) 292-294
31. N.T. Shaked, S. Messika, S. Dolev, J. Rosen, Optical solution for bounded NP-complete problems, A poster in the Bi-National (Israeli-Italian) Workshop on Optronics (Il-It-Opt), 2005. Also in Proc. of SPIE Symposium on Optics & Photonics the Optical Information Systems IV Conference, vol. 63110G-1, Aug. 2006, San Diego. Journal version, J. Appl. Optics 46 (5) (2007) 711-724
32. Shaked N.T., Simon G., Tabib T., Messika S., Dolev S., and Rosen J. Optical binary matrix synthesis for solving bounded NP-complete combinatorial problems. J. Opt. Eng. 46 10 (2007) 108201
33. Shamir A. Factoring large numbers with the TWINKLE device. Proc. CHES. LNCS vol. 1717 2-12 (1999), Springer-Verlag
34. Shamir A., and Tromer E. Factoring large numbers with the TWIRL device. Proc. of the International Cryptology Conference (Crypto). LNCS vol. 2729 (2003), Springer-Verlag 1-26
35. Valiant L. The complexity of computing the permanent. Theoret. Comput. Sci. 8 (1979) 189-201
36. van Emde Boas P. Machine models and simulation. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) (1990) 1-66
37. Woods D. Optical computing and computational complexity. Proc. of the Fifth International Conference on Unconventional Computation. LNCS vol. 4135 (2006) 27-40
38. Woods D., and Gibson J.P. Lower bounds on the computational power of an optical model of computation. Proc. of the Fourth International Conference on Unconventional Computation. LNCS vol. 3699 (2005) 237-250 Journal version, Nat. Comput. 7(1) 2008 95-108