Solving the generalized Subset Sum problem with a light based device

Natural Computing

Volumn 10, Issue 1, 2011, Pages 541-550

  Hasan, Masud ^a   Hossain, Shabab ^a   Rahman, Md Mahmudur ^a   Rahman, M Sohel ^a,b  

^a BANGLADESH UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Bangladesh)

^b KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Combinatorial problems; NP Complete problems; Optical computing

Indexed keywords

ACCURACY; ARTIFICIAL INTELLIGENCE; AUTOMATION; COMPUTER ANALYSIS; COMPUTER SYSTEM; CONFERENCE PAPER; DEVICE; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; MATHEMATICAL PARAMETERS; RESEARCH;

EID: 79952743204     PISSN: 15677818     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11047-010-9205-1     Document Type: Conference Paper

References (23)

1. Aaronson S (2005) Np-complete problems and physical reality. ACM SIGACT News Complexity Theory Column, ECCC TR05-026
2. Adleman L (1994) Molecular computation of solutions to combinatorial problems. Science 266:1021-1024 (Pubitemid 24373714)
3. Agrawal GP (2002) Fibre-optic communication systems, 3rd edn. Wiley-Interscience, New York
4. Bringsjord S, Taylor J (2004) P=np. cs.CC/0406056
5. J Faist 2005 Optoelectronics: silicon shines on Nature 433 691 692 10.1038/433691a (Pubitemid 40292963)
6. Feitelson DG (1998) Optical computing: a survey for computer scientists. MIT Press, Cambridge
7. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, New York
8. JW Goodman 1982 Architectural development of optical data processing systems Aust J Electr Electron Eng 2 139 149
9. Hasan M, Shabab Hossain SM, Mahmudur Rahman Md, Sohel Rahman M (2009) An optical solution for the subset sum problem. In: Peper F, Umeo H, Matsui N, Isokawa T (eds) Natural computing: 4th international workshop on natural computing. Himeji, Japan, September 2009 Proceedings, pp 165-173
10. Raqibul Hasan Md, Sohel Rahman M (2009) Computing a solution for the subset sum problem with a light based device. In Dolev S, Oltean M (eds) OSC, vol 5882 of Lecture notes in computer science. Springer, Berlin, pp 70-76
11. TD Kieu 2003 Quantum algorithm for Hilbert's tenth problem Int J Theor Phys 42 1461 1478 2021223 1037.81016 10.1023/A:1025780028846 (Pubitemid 38103277)
12. Murphy N, Naughton TJ, Woods D, Henley B, McDermott K, Duffy E, Burgt PJM, Woods N (2006) Implementations of a model of physical sorting. Luniver Press, Frome, pp 79-100
13. M Oltean 2008 Solving the Hamiltonian path problem with a light-based computer Nat Comput 7 1 57 70 2407932 1146.68405 10.1007/s11047-007-9042-z (Pubitemid 351234456)
14. M Oltean 2009 Light-based string matching Nat Comput 8 1 121 132 2486552 1192.68203 10.1007/s11047-007-9033-0
15. M Oltean O Muntean 2008 Exact cover with light New Gener Comput 26 4 329 346 1191.68127 10.1007/s00354-008-0049-5
16. M Oltean O Muntean 2009 Solving the subset-sum problem with a light-based device Nat Comput 8 2 321 331 2505753 1188.68141 10.1007/s11047-007-9059-3
17. M Panicia S Koehl 2005 The silicon solution IEEE Spectrum 42 10 38 43 10.1109/MSPEC.2005.1515959
18. JH Reif A Tyagi 1997 Efficient parallel algorithms for optical computing with the discrete fourier transform primitive Appl Opt 36 29 7327 7340 10.1364/AO.36.007327 (Pubitemid 127688005)
19. H Rong R Jones A Liu O Cohen D Hak A Fang M Paniccia 2005 A continuous wave Raman silicon laser Nature 433 725 728 10.1038/nature03346 (Pubitemid 40292977)
20. H Rong A Liu R Jones O Cohen D Hak R Nicolaescu A Fang M Paniccia 2005 An all-silicon Raman laser Nature 433 292 294 10.1038/nature03273
21. D Schultes 2006 Rainbow sort: sorting at the speed of light Nat Comput 5 1 67 82 2224168 1113.68042 10.1007/s11047-004-3379-3 (Pubitemid 43125849)
22. PW Shor 1997 Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer SIAM J Comput 26 5 1484 1509 1471990 1005.11065 10.1137/S0097539795293172 (Pubitemid 127613100)
23. A Vergis K Steiglitz B Dickinson 1996 The complexity grave of analog computation Math Comput Simul 28 91 113 10.1016/0378-4754(86)90105-9