Lower Bounds on the Complexity of the Wavelength-Based Machine
From MaRDI portal
Publication:4648192
DOI10.1007/978-3-642-32894-7_10zbMath1374.68214OpenAlexW32500615MaRDI QIDQ4648192
Mohammad-Hadi Foroughmand-Araabi, Sama Goliaei
Publication date: 8 November 2012
Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32894-7_10
complexitysatisfiability problemcomputational modelnatural computingoptical computingunconventional computingwavelength-based machine
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
An optical solution for the set splitting problem, On the complexity of nonuniform wavelength-based machine