Masking traveling beams: Optical solutions for NP-complete problems, trading space for time
Authors:
- Shlomi DolevSDShlomi Dolev
- Hen FitoussiHFHen Fitoussi
- 1 February 2010
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 411 (6) , 837-853
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Solving the subset-sum problem with a light-based deviceNatural Computing, 2007
- The Traveling Beams Optical Solutions for Bounded NP-Complete ProblemsLecture Notes in Computer Science, 2007
- An all-silicon Raman laserNature, 2005
- Optical computingResonance, 2003
- Model of computation for Fourier optical processors2000
- On the hardness of computing the permanent of random matricescomputational complexity, 1996
- Computability and complexity of ray tracingDiscrete & Computational Geometry, 1994
- The complexity of computing the permanentTheoretical Computer Science, 1979
- Secure communications over insecure channelsCommunications of the ACM, 1978
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973