Unconventional Computation
From MaRDI portal
Publication:5479218
DOI10.1007/11560319zbMath1161.68464OpenAlexW4254053743MaRDI QIDQ5479218
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
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (3)
Masking traveling beams: optical solutions for NP-complete problems, trading space for time ⋮ On the computational power of the light: a plan for breaking data encryption standard ⋮ Optical computing
This page was built for publication: Unconventional Computation
