Unconventional Computation

DOI10.1007/11560319zbMATH Open1161.68464OpenAlexW4254053743MaRDI QIDQ5479218FDOQ5479218

J. Paul Gibson, Damien Woods

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

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

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)

Cited In (7)

• Masking traveling beams: optical solutions for NP-complete problems, trading space for time
• Optical computing
• Algorithms and Computation
• Title not available (Why is that?)
• 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)