Solving the subset-sum problem with a light-based device

DOI10.1007/s11047-007-9059-3zbMath1188.68141arXiv0708.1964OpenAlexW2079532011WikidataQ58609915 ScholiaQ58609915MaRDI QIDQ1024028

Mihai Oltean, Oana Muntean

Publication date: 16 June 2009

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

Full work available at URL: https://arxiv.org/abs/0708.1964

zbMATH Keywords

NP-completeunconventional computingsubset sumoptical solutions

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (5)

Masking traveling beams: optical solutions for NP-complete problems, trading space for time ⋮ On the computational power of the light: a plan for breaking data encryption standard ⋮ An optical solution for the set splitting problem ⋮ Solving the generalized subset sum problem with a light based device ⋮ On the complexity of nonuniform wavelength-based machine

Cites Work

• Unnamed Item
• Unnamed Item
• Rainbow sort: Sorting at the speed of light
• Solving the Hamiltonian path problem with a light-based computer
• The complexity of analog computation
• Quantum algorithm for Hilbert's tenth problem
• An optical model of computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Multistage Cutting Stock Problems of Two and More Dimensions
• A Light-Based Device for Solving the Hamiltonian Path Problem

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