Solving the generalized Subset Sum problem with a light based device

Authors:
Masud Hasan;Shabab Hossain;Md. Mahmudur Rahman;M. Sohel Rahman
Affiliations:
Department of CSE, BUET, Dhaka, Bangladesh 1000;Department of CSE, BUET, Dhaka, Bangladesh 1000;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, London, England, UK WC2R 2LS
Venue:
Natural Computing: an international journal
Year:
2011

Citing 11
Cited 2

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
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
Computing a Solution for the Subset Sum Problem with a Light Based Device

OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
The silicon solution [silicon photonics]

IEEE Spectrum

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
A new light-based solution to the Hamiltonian path problem

Future Generation Computer Systems

Quantified Score

Hi-index	0.00

Visualization

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.