Solving the subset-sum problem with a light-based device

Natural Computing

Volumn 8, Issue 2, 2009, Pages 321-331

  Oltean, Mihai ^a   Muntean, Oana ^a  

^a BABE BOLYAI UNIVERSITY   (Romania)

Author keywords

NP complete; Optical solutions; Subsetsum; Unconventional computing

Indexed keywords

ALGORITHM; ANALYTICAL EQUIPMENT; ARTICLE; DISPERSION; ELECTRICITY; FOURIER TRANSFORMATION; LASER; LIGHT; MATHEMATICAL COMPUTING; PROBLEM SOLVING; VELOCITY;

EID: 65549084779     PISSN: 15677818     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11047-007-9059-3     Document Type: Article

References (32)

1. Aaronson S (2005) NP-complete problems and physical reality, ACM SIGACT News Complexity Theory Column, March. ECCC TR05-026, quant-ph/0502072
2. Adleman L (1994) Molecular computation of solutions to combinatorial problems. Science 266:1021-1024
3. Agrawal GP (2002) Fiber-optic communication systems, 3rd edn. Wiley-Interscience
4. Bajcsy M, Zibrov AS, Lukin MD (2003) Stationary pulses of light in an atomic medium. Nature 426:638-641
5. Bringsjord S, Taylor J (2004) P = NP, cs.CC/0406056
6. Cormen TH, Leiserson CE, Rivest RR (1990) Introduction to algorithms. MIT Press
7. Faist J (2005) Optoelectronics: Silicon shines on. Nature 433:691-692
8. Feitelson DG (1988) Optical computing: A survey for computer scientists, MIT Press
9. Flyckt SO, Marmonier C (2002) Photomultiplier tubes: Principles and applications. Photonis, Brive, France
10. Garey MR, Johnson DS (1979) Computers and intractability: A guide to NP-completeness. Freeman & Co, San Francisco, CA
11. Gilmore PC, Gomory RE (1965) Multistage cutting stock problems of two and more dimensions. Oper Res 13(1):94-120
12. Goodman JW (1982) Architectural development of optical data processing systems. Aust J Electr Electron Eng 2:139-149
13. Haist T and Osten W (2007) An optical solution for the traveling salesman problem. Opt Express 15:10473-10482
14. Hartmanis J (1995) On the weight of computations. B EATCS 55:136-138
15. Hau LV, Harris SE, Dutton Z, Behroozi CH (1999) Light speed reduction to 17 m per second in an ultracold atomic gas. Nature 397:594-598
16. Kieu TD (2003) Quantum algorithm for Hilbert's tenth problem. Int J Theor Phys 42:1461-1478
17. Lenslet website (2005) http://www.lenslet.com
18. Liu C, Dutton Z, Behroozi CH, Hau LV (2001) Observation of coherent optical information storage in an atomic medium using halted light pulses. Nature 409:490-493
19. Murphy N, Naughton TJ, Woods D, Henley B, McDermott K, Duffy E, van der Burgt PJM, Woods N (2006) Implementations of a model of physical sorting. In: Adamatzky A, Teuscher C (eds) From Utopian to genuine unconventional computers workshop, Luniver Press, pp 79-100
20. Naughton TJ (2000) A model of computation for Fourier optical processors. In: Lessard RA, Galstian T (eds) Optics in computing, Proceedings SPIE 4089:24-34
21. Oltean M (2006) A light-based device for solving the Hamiltonian path problem. In: Calude C et al (eds) Unconventional computing LNCS 4135, Springer-Verlag, pp 217-227
22. Oltean M (2007) Solving the Hamiltonian path problem with a light-based computer. Nat Comput doi: 10.1007/s11047-007-9042-z
23. Paniccia M, Koehl S (2005) The silicon solution. IEEE Spectrum, IEEE Press, October
24. Reif JH, Tyagi A (1997) Efficient parallel algorithms for optical computing with the discrete Fourier transform primitive. Appl Optics 36(29):7327-7340
25. Rong H, Jones R, Liu A, Cohen O, Hak D, Fang A, Paniccia M (2005a) A continuous-wave Raman silicon laser. Nature 433:725-728
26. Rong H, Liu A, Jones R, Cohen O, Hak D, Nicolaescu R, Fang A, Paniccia M (2005b) An all-silicon Raman laser. Nature 433:292-294
27. Schultes D (2005) Rainbow Sort: Sorting at the speed of light. Nat Comput, Springer-Verlag 5(1):67-82
28. Shaked NT, Messika S, Dolev S and Rosen J (2007) Optical solution for bounded NP-complete problems. Appl Optics 46:711-724
29. Shor P (1997) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput 26(5):1484-1509
30. Thoughts on the subset sum problem (P vs. NP) (accessed 2006) http://idrone.net/2006/06/11/thoughts-on-the-subset-sum-problem-p-vs-np
31. Vergis A, Steiglitz K, Dickinson B (1986) The complexity of analog computation. Math Comput Simulat 28:91-113
32. Woods D, Naughton TJ (2005) An optical model of computation. Theor Comput Sci 334(1-3):227-258