Lower bounds on the complexity of the wavelength-based machine

DOI10.1007/978-3-642-32894-7_10MaRDI QIDQ4648192zbMATH OpenOpenAlexFDO

Authors Sama Goliaei, Mohammad-Hadi Foroughmand-Araabi

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

zbMATH Keywords

complexitynatural computingoptical computingunconventional computingwavelength-based machinecomputational modelsatisfiability problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Light ray concentration reduces the complexity of the wavelength-based machine on PSPACE languages
• On the complexity of nonuniform wavelength-based machine
• Lower bounds on the computational power of an optical model of computation
• Optical Computing and Computational Complexity
• An optical model of computation

Cited in

(3)

• On the complexity of nonuniform wavelength-based machine
• An optical solution for the set splitting problem
• Light ray concentration reduces the complexity of the wavelength-based machine on PSPACE languages

This page was built for publication: Lower bounds on the complexity of the wavelength-based machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648192)