Unconventional Computation

DOI10.1007/11560319MaRDI QIDQ5479218zbMATH OpenOpenAlexFDO

Authors Damien Woods, J. Paul Gibson

Publication date 7 July 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11560319

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Algorithms and Computation
• Lower bounds on the computational power of an optical model of computation
• Optical Computing and Computational Complexity
• scientific article; zbMATH DE number 1738670
• New Computational Paradigms

Cited in

(8)

• Masking traveling beams: optical solutions for NP-complete problems, trading space for time
• Lower bounds on the computational power of an optical model of computation
• Optical computing
• Algorithms and Computation
• scientific article; zbMATH DE number 1738670 (Why is no real title available?)
• An optical model of computation
• New Computational Paradigms
• On the computational power of the light: a plan for breaking data encryption standard

This page was built for publication: Unconventional Computation

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