Solving a generalized version of the exact cover problem with a light-based device

Authors:
S. M. Shabab Hossain;Md. Mahmudur Rahman;M. Sohel Rahman
Affiliations:
Department of CSE, BUET and Department of CSE, UIU, Dhaka, Bangladesh;Department of CSE, BUET and Department of CSE, UIU, Dhaka, Bangladesh;Department of CSE, UIU, Dhaka, Bangladesh
Venue:
OSC'10 Proceedings of the Third international conference on Optical supercomputing
Year:
2010

Citing 5
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Solving the Hamiltonian path problem with a light-based computer

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
Solving the generalized Subset Sum problem with a light based device

Natural Computing: an international journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a light-based device that is capable of solving a generalized version of the exact cover problem.