Skip to main content
SpringerLink
Log in

Solving the generalized Subset Sum problem with a light based device

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

Recently, a number of researchers have suggested light-based devices to solve combinatorially interesting problems. In this paper, we design a light based device to solve a generalized version of the Subset Sum problem which was previously handled by Oltean and Muntean. We further design a system which is capable of providing us with the solution subset of the problem in addition to the YES/NO answer to the question of whether there exists a solution or not.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Notes

  1. The answer of the decision problem would be found from the device designed in the previous section.

References

  • Aaronson S (2005) Np-complete problems and physical reality. ACM SIGACT News Complexity Theory Column, ECCC TR05-026

  • Adleman L (1994) Molecular computation of solutions to combinatorial problems. Science 266:1021–1024

    Google Scholar 

  • Agrawal GP (2002) Fibre-optic communication systems, 3rd edn. Wiley-Interscience, New York

    Book  Google Scholar 

  • Bringsjord S, Taylor J (2004) P=np. cs.CC/0406056

  • Faist J (2005) Optoelectronics: silicon shines on. Nature 433:691–692

    Article  Google Scholar 

  • Feitelson DG (1998) Optical computing: a survey for computer scientists. MIT Press, Cambridge

    Google Scholar 

  • Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, New York

    MATH  Google Scholar 

  • Goodman JW (1982) Architectural development of optical data processing systems. Aust J Electr Electron Eng 2:139–149

    Google Scholar 

  • 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

  • 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

  • Kieu TD (2003) Quantum algorithm for Hilbert’s tenth problem. Int J Theor Phys 42:1461–1478

    Article  MathSciNet  MATH  Google Scholar 

  • 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

    Google Scholar 

  • Oltean M (2008) Solving the Hamiltonian path problem with a light-based computer. Nat Comput 7(1):57–70

    Article  MathSciNet  MATH  Google Scholar 

  • Oltean M (2009) Light-based string matching. Nat Comput 8(1):121–132

    Article  MathSciNet  MATH  Google Scholar 

  • Oltean M, Muntean O (2008) Exact cover with light. New Gener Comput 26(4):329–346

    Article  MATH  Google Scholar 

  • Oltean M, Muntean O (2009) Solving the subset-sum problem with a light-based device. Nat Comput 8(2):321–331

    Article  MathSciNet  MATH  Google Scholar 

  • Panicia M, Koehl S (2005) The silicon solution. IEEE Spectrum 42(10):38–43

    Article  Google Scholar 

  • Reif JH, Tyagi A (1997) Efficient parallel algorithms for optical computing with the discrete fourier transform primitive. Appl Opt 36(29):7327–7340

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • Schultes D (2006) Rainbow sort: sorting at the speed of light. Nat Comput 5(1):67–82

    Article  MathSciNet  MATH  Google Scholar 

  • Shor PW (1997) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput 26(5):1484–1509

    Article  MathSciNet  MATH  Google Scholar 

  • Vergis A, Steiglitz K, Dickinson B (1996) The complexity grave of analog computation. Math Comput Simul 28:91–113

    Article  Google Scholar 

Download references

Acknowledgement

The authors gratefully acknowledge the constructive comments and suggestions of the reviewers which helped to improve the quality of the paper.

Author information

Authors and Affiliations

  1. Department of CSE, BUET, Dhaka, 1000, Bangladesh

    Masud Hasan, Shabab Hossain, Md. Mahmudur Rahman & M. Sohel Rahman

  2. Algorithm Design Group, Department of Computer Science, King’s College London, Strand, London, WC2R 2LS, England, UK

    M. Sohel Rahman

Authors
  1. Masud Hasan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shabab Hossain
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Md. Mahmudur Rahman
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Sohel Rahman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Masud Hasan.

Additional information

This research work was conducted as part of the undergraduate thesis work of the second and third authors. Authors’ names are listed in alphabetic order. Preliminary version appeared in Hasan et al. (2009).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hasan, M., Hossain, S., Rahman, M.M. et al. Solving the generalized Subset Sum problem with a light based device. Nat Comput 10, 541–550 (2011). https://doi.org/10.1007/s11047-010-9205-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-010-9205-1

Keywords

Search

Navigation