Computing a Solution for the Subset Sum Problem with a Light Based Device

Authors:
Md. Raqibul Hasan;M. Sohel Rahman
Affiliations:
Department of CSE, BUET, Dhaka, Bangladesh 1000;Department of CSE, BUET, Dhaka, Bangladesh 1000 and Algorithm Design Group, Department of Computer Science, King's College London, Strand, London, England WC2R 2LS
Venue:
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
Year:
2009

Citing 10
Cited 3

The complexity of analog computation

Mathematics and Computers in Simulation
Optical computing: a survey for computer scientists

Optical computing: a survey for computer scientists
Molecular computation of solutions to combinatorial problems

Science
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Guest Column: NP-complete problems and physical reality

ACM SIGACT News
Rainbow Sort: Sorting at the Speed of Light

Natural Computing: an international journal
Solving the Hamiltonian path problem with a light-based computer

Natural Computing: an international journal
Light-based string matching

Natural Computing: an international journal
Solving the subset-sum problem with a light-based device

Natural Computing: an international journal

Solving the generalized Subset Sum problem with a light based device

Natural Computing: an international journal
Solving a generalized version of the exact cover problem with a light-based device

OSC'10 Proceedings of the Third international conference on Optical supercomputing
An optical solution for the SAT Problem

OSC'10 Proceedings of the Third international conference on Optical supercomputing

Quantified Score

Hi-index	0.01

Visualization

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.