On the complexity of nonuniform wavelength-based machine
From MaRDI portal
Recommendations
- Lower bounds on the complexity of the wavelength-based machine
- Light ray concentration reduces the complexity of the wavelength-based machine on PSPACE languages
- Machines Over the Reals and Non-Uniformity
- Optical Computing and Computational Complexity
- Instruction sequence based non-uniform complexity classes
Cites work
- Almost-natural proofs
- An optical model of computation
- Approximable sets
- Complexity Theory
- Computability and complexity of ray tracing
- Exact cover with light
- Light-based string matching
- Lower bounds on the complexity of the wavelength-based machine
- Lower bounds on the computational power of an optical model of computation
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time
- Optical Switching Networks
- Optical computing
- Solving the Hamiltonian path problem with a light-based computer
- Solving the subset-sum problem with a light-based device
Cited in
(3)
This page was built for publication: On the complexity of nonuniform wavelength-based machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256966)
