Solving the generalized subset sum problem with a light based device

DOI10.1007/s11047-010-9205-1zbMath1213.68417OpenAlexW2056630895MaRDI QIDQ537835

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

Publication date: 23 May 2011

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-010-9205-1

zbMATH Keywords

combinatorial problemsNP-complete problemsoptical computing

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer system organization (68M99)

Related Items (1)

On the computational power of the light: a plan for breaking data encryption standard

Cites Work

• Unnamed Item
• Exact cover with light
• Light-based string matching
• Rainbow sort: Sorting at the speed of light
• Solving the Hamiltonian path problem with a light-based computer
• Solving the subset-sum problem with a light-based device
• The complexity of analog computation
• Quantum algorithm for Hilbert's tenth problem
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

This page was built for publication: Solving the generalized subset sum problem with a light based device