Recommendations
- An optical solution for the set splitting problem
- Solving the subset-sum problem with a light-based device
- The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
- Solving the generalized subset sum problem with a light based device
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 743584 (Why is no real title available?)
- A Light-Based Device for Solving the Hamiltonian Path Problem
- An Algorithm for SAT Without an Extraction Phase
- An optical model of computation
- Dynamic programming on the word RAM
- Introduction to algorithms
- Rainbow sort: Sorting at the speed of light
- Solving the Hamiltonian path problem with a light-based computer
- The On-Line Encyclopedia of Integer Sequences
- The complexity of analog computation
Cited in
(10)- On the complexity of nonuniform wavelength-based machine
- Solving the generalized subset sum problem with a light based device
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time
- Solving the subset-sum problem with a light-based device
- A Light-Based Device for Solving the Hamiltonian Path Problem
- The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
- An optical solution for the set splitting problem
- On the computational power of the light: a plan for breaking data encryption standard
- Using light to implement parallel Boolean algebra
- Set covering with our eyes closed
This page was built for publication: Exact cover with light
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732172)
