Abstract
We propose a new way for computing a solution to the subset sum problem. Here, we use a special computational device which uses light ray. The device has a graph-like representation and the light traverses it by following the routes given by the connections between nodes. Our device can solve the subset sum decision problem as well as can compute a solution instance for it.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 266 (1994)
Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484–1509 (1997)
Bringsjord, S., Taylor, J.: P=np. cs.CC/0406056 (2004)
Aaronson, S.: Np-complete problems and physical reality. ACM SIGACT News Complexity Theory Column ECCC TR05-026 (2005)
Vergis, A., Steiglitz, K., Dickinson, B.: The complexity graveof analog computation. Mathematics and Computers in Simulation 28, 91–113 (1986)
Kieu, T.D.: Quantum algorithm for hilbert’s tenth problem. Intl. Journal of Theoretical Physics 42, 1461–1478 (2003)
Goodman, J.W.: Architectural development of optical data processing systems. Aust. J. Electr. Electron. Eng. 2, 139–149 (1982)
Reif, J., Tyagi, A.: Efficient parallel algorithms for optical computing with the discrete fourier transform primitive. Applied optics 36(29), 7327–7340 (1997)
Rong, H., Liu, A., Jones, R., Cohen, O., Hak, D., Nicolaescu, R., Fang, A., Paniccia, M.: An all-silicon raman laser. Nature 433, 292–294 (2005)
Rong, H., Jones, R., Liu, A., Cohen, O., Hak, D., Fang, A., Paniccia, M.: A continuous wave raman silicon laser. Nature 433, 725–728 (2005)
Paniccia, M., Koehl, S.: The silicon solution. IEEE Spectrum, IEEE Press
Faist, J.: Optoelectronics: silicon shines on. Nature 433, 691–692 (2005)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
Oltean, M.: Solving the hamiltonian path problem with a light-based computer. Natural Computing 7(1), 57–70 (2008)
Oltean, M., Muntean, O.: Exact cover with light. New Generation Comput. 26(4), 329–346 (2008)
Oltean, M., Muntean, O.: Solving the subset-sum problem with a light-based device. Natural Computing (to appear)
Schultes, D.: Rainbow sort: Sorting at the speed of light. Natural Computing 5(1), 67–82 (2006)
Murphy, N., Naughton, T.J., Woods, D., Henley, B., McDermott, K., Duffy, E., van der Burgt, P.J.M., Woods, N.: Implementations of a model of physical sorting, pp. 79–100. Luniver Press (2006)
Oltean, M.: Light-based string matching. Natural Computing 8(1), 121–132 (2009)
Agrawal, G.: Fibre-optic communication systems, 3rd edn. Wiley-Interscience, Hoboken (2002)
Feitelson, D.: Optical computing: A survey for computer scientists. MIT Press, Cambridge (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hasan, M.R., Rahman, M.S. (2009). Computing a Solution for the Subset Sum Problem with a Light Based Device. In: Dolev, S., Oltean, M. (eds) Optical SuperComputing. OSC 2009. Lecture Notes in Computer Science, vol 5882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10442-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-10442-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10441-1
Online ISBN: 978-3-642-10442-8
eBook Packages: Computer ScienceComputer Science (R0)