Solving the generalized subset sum problem with a light based device
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Exact cover with light
- Light-based string matching
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum algorithm for Hilbert's tenth problem
- 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
Cited in
(6)- Exact cover with light
- An optical solution for the set splitting problem
- Solving the Hamiltonian path problem with a light-based computer
- On the computational power of the light: a plan for breaking data encryption standard
- A Light-Based Device for Solving the Hamiltonian Path Problem
- Solving the subset-sum problem with a light-based device
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)