On the complexity of nonuniform wavelength-based machine
DOI10.1007/s11047-014-9412-2zbMath1456.68052OpenAlexW1994506055MaRDI QIDQ256966
Mohammad-Hadi Foroughmand-Araabi, Sama Goliaei
Publication date: 14 March 2016
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-014-9412-2
complexitynonuniform complexitycomplexity classesnondeterministic Boolean circuitsoptical computingTuring machine with adviceunconventional computingwavelength-based machine
Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other nonclassical models of computation (68Q09)
Related Items (1)
Cites Work
- Almost-natural proofs
- Exact cover with light
- Light-based string matching
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time
- Solving the Hamiltonian path problem with a light-based computer
- Lower bounds on the computational power of an optical model of computation
- Solving the subset-sum problem with a light-based device
- Optical computing
- Computability and complexity of ray tracing
- An optical model of computation
- Approximable sets
- Complexity Theory
- Optical Switching Networks
- Lower Bounds on the Complexity of the Wavelength-Based Machine
This page was built for publication: On the complexity of nonuniform wavelength-based machine