Masking traveling beams: optical solutions for NP-complete problems, trading space for time

DOI10.1016/j.tcs.2009.06.030zbMath1191.68122OpenAlexW2036831179MaRDI QIDQ847661

Hen Fitoussi, Shlomi Dolev

Publication date: 19 February 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.030

zbMATH Keywords

NP-complete problemsoptical computing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer system organization (68M99)

Related Items (2)

On the computational power of the light: a plan for breaking data encryption standard ⋮ On the complexity of nonuniform wavelength-based machine

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Solving the subset-sum problem with a light-based device
• Computability and complexity of ray tracing
• On the hardness of computing the permanent of random matrices
• Secure communications over insecure channels
• Reducibility among Combinatorial Problems
• The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
• Advances in Cryptology - CRYPTO 2003
• Optical Computing and Computational Complexity
• A Light-Based Device for Solving the Hamiltonian Path Problem
• Unconventional Computation
• The complexity of theorem-proving procedures
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Masking traveling beams: optical solutions for NP-complete problems, trading space for time