Masking traveling beams: Optical solutions for NP-complete problems, trading space for time-Reference-Cited by-同舟云学术

Masking traveling beams: Optical solutions for NP-complete problems, trading space for time

Published:2010-02 Issue:6 Volume:411 Page:837-853
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Dolev Shlomi,Fitoussi Hen

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference38 articles.

1. Space–time complexity in optical computing;Caulfield;SPIE Optical Information-Processing Systems and Architectures II,1990

2. S.A. Cook, The complexity of theorem-proving procedures, in: Proc. of the 3rd Ann. ACM Symp. on Theory of Computing, 1971, pp. 151–158

3. S. Dolev, H. Fitoussi, Primitive operations for graph-optical processor, in: 6th Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms, May 2006

4. S. Dolev, H. Fitoussi, The traveling beams: Optical solutions for bounded NP-Complete problems, Technical Report #07–04, Ben Gurion University of the Negev, January 2007

5. The traveling beams: Optical solutions for bounded NP-complete problems;Dolev,2007

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the computational power of the light: An optical method for the subgraph isomorphism problem;International Journal of Modeling, Simulation, and Scientific Computing;2022-07-14

2. Stigmergic electronic gates and networks;Journal of Computational Electronics;2021-10-13

3. A scalable photonic computer solving the subset sum problem;Science Advances;2020-01-31

4. On the computational power of the light: A plan for breaking data encryption standard;Theoretical Computer Science;2019-06

5. All-Optical Reinforcement Learning In Solitonic X-Junctions;Scientific Reports;2018-04-09