Solving the generalized subset sum problem with a light based device
From MaRDI portal
Publication:537835
DOI10.1007/s11047-010-9205-1zbMath1213.68417MaRDI 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
68R05: Combinatorics in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68M99: Computer system organization
Related Items
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