The Traveling Beams Optical Solutions for Bounded NP-Complete Problems

DOI10.1007/978-3-540-72914-3_12MaRDI QIDQ5426020zbMATH OpenOpenAlexFDO

Authors Shlomi Dolev, Hen Fitoussi

Publication date 15 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72914-3_12

Mathematics Subject Classification ID

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

Recommendations

• Masking traveling beams: optical solutions for NP-complete problems, trading space for time
• An optical solution for the set splitting problem
• Optical solution for hard on average \#P-complete instances (using exponential space for solving instances of the permanent)
• Exact cover with light
• Solving the subset-sum problem with a light-based device

Cited in

(9)

• Optical computing
• An optical solution for the set splitting problem
• scientific article; zbMATH DE number 97096 (Why is no real title available?)
• LaserTank is NP-Complete
• Solving the circular open dimension problem by using separate beams and look-ahead strategies
• Optical solution for hard on average \#P-complete instances (using exponential space for solving instances of the permanent)
• Exact cover with light
• Masking traveling beams: optical solutions for NP-complete problems, trading space for time
• Solving the Hamiltonian path problem with a light-based computer

This page was built for publication: The Traveling Beams Optical Solutions for Bounded NP-Complete Problems

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