An optical solution for the set splitting problem
From MaRDI portal
Publication:1698573
DOI10.1515/ausi-2017-0009zbMath1425.68113arXiv1712.00651OpenAlexW2771471062MaRDI QIDQ1698573
Publication date: 16 February 2018
Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.00651
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- On the complexity of nonuniform wavelength-based machine
- Computing transparently: The independent sets in a graph
- Exact cover with light
- Solving the subset-sum problem with a light-based device
- Lower Bounds on the Complexity of the Wavelength-Based Machine
- Light Ray Concentration Reduces the Complexity of the Wavelength-Based Machine on PSPACE Languages
- The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
- A Light-Based Device for Solving the Hamiltonian Path Problem
This page was built for publication: An optical solution for the set splitting problem
