The Traveling Beams Optical Solutions for Bounded NP-Complete Problems

From MaRDI portal

Revision as of 02:37, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5426020

Jump to:navigation, search

DOI10.1007/978-3-540-72914-3_12zbMath1201.68032OpenAlexW1500047489MaRDI QIDQ5426020

Shlomi Dolev, Hen Fitoussi

Publication date: 15 November 2007

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

Full work available at URL: https://doi.org/10.1007/978-3-540-72914-3_12

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer system organization (68M99)

Related Items (4)

Masking traveling beams: optical solutions for NP-complete problems, trading space for time ⋮ Optical solution for hard on average \#P-complete instances (using exponential space for solving instances of the permanent) ⋮ An optical solution for the set splitting problem ⋮ Optical computing

This page was built for publication: The Traveling Beams Optical Solutions for Bounded NP-Complete Problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5426020&oldid=20177731"