Exact cover with light
From MaRDI portal
Publication:732172
DOI10.1007/S00354-008-0049-5zbMATH Open1191.68127OpenAlexW1654960974WikidataQ58609922 ScholiaQ58609922MaRDI QIDQ732172FDOQ732172
Authors: Mihai Oltean, Oana Muntean
Publication date: 9 October 2009
Published in: New Generation Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00354-008-0049-5
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
- The On-Line Encyclopedia of Integer Sequences
- Introduction to algorithms
- Title not available (Why is that?)
- An optical model of computation
- Title not available (Why is that?)
- Solving the Hamiltonian path problem with a light-based computer
- The complexity of analog computation
- Rainbow sort: Sorting at the speed of light
- Dynamic programming on the word RAM
- An Algorithm for SAT Without an Extraction Phase
- A Light-Based Device for Solving the Hamiltonian Path Problem
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
Uses Software
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)