Solving the generalized subset sum problem with a light based device

DOI10.1007/S11047-010-9205-1zbMATH Open1213.68417OpenAlexW2056630895MaRDI QIDQ537835FDOQ537835

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

optical computingcombinatorial problemsNP-complete problems

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)

Cites Work

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

Cited In (1)

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

   Recommendations

• Solving the subset-sum problem with a light-based device 👍 👎
• A Light-Based Device for Solving the Hamiltonian Path Problem 👍 👎
• Solving the Hamiltonian path problem with a light-based computer 👍 👎
• Exact cover with light 👍 👎
• An optical solution for the set splitting problem 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537835)