S. Dolev and H. Fitoussi, “Masking traveling beams: optical solutions for NP-complete problems, trading space for time,” Theor. Comput. Sci. 411, 837–853 (2010).

[CrossRef]

H. J. Caulfield and S. Dolev, “Why future supercomputing requires optics,” Nat. Photonics 4, 261–263 (2010).

[CrossRef]

X. Zhou, G. Yue, Z. Yang, and K. Li, “A new approach for the dominating-set problem by DNA-based supercomputing,” J. Software 5, 662–670 (2010).

[CrossRef]

M. Oltean, “Solving the Hamiltonian path problem with a light-based computer,” Nat. Comput. 7, 57–70 (2008).

[CrossRef]

T. Haist, and W. Osten, “An optical solution for the traveling salesman problem,” Opt. Express 15, 10473–10482 (2007).

[CrossRef]

N. T. Shaked, S. Messika, S. Dolev, and J. Rosen, “Optical solution for bounded NP-complete problems,” Appl. Opt. 46, 711–724 (2007).

[CrossRef]

N. T. Shaked, T. Tabib, G. Simon, S. Messika, S. Dolev, and J. Rosen, “Optical binary-matrix synthesis for solving bounded NP-complete combinatorial problems,” Opt. Eng. 46, 108201 (2007).

[CrossRef]

V. Koltun and C. H. Papadimitriou, “Approximately dominating representatives,” Theor. Comput. Sci. 371, 148–154 (2007).

[CrossRef]

J. Wu, “Extended dominating-set-based routing in ad hoc wireless networks with unidirectional link,” IEEE Trans. Parallel Distrib. Syst. 13, 866–881 (2002).

[CrossRef]

H. J. Caulfield and S. Dolev, “Why future supercomputing requires optics,” Nat. Photonics 4, 261–263 (2010).

[CrossRef]

H. J. Caulfield and S. Dolev, “Why future supercomputing requires optics,” Nat. Photonics 4, 261–263 (2010).

[CrossRef]

S. Dolev and H. Fitoussi, “Masking traveling beams: optical solutions for NP-complete problems, trading space for time,” Theor. Comput. Sci. 411, 837–853 (2010).

[CrossRef]

D. E. Tamir, N. T. Shaked, P. J. Wilson, and S. Dolev, “High-speed and low-power electro-optical DSP coprocessor,” J. Opt. Soc. Am. A 26, A11–A20 (2009).

[CrossRef]

N. T. Shaked, S. Messika, S. Dolev, and J. Rosen, “Optical solution for bounded NP-complete problems,” Appl. Opt. 46, 711–724 (2007).

[CrossRef]

N. T. Shaked, T. Tabib, G. Simon, S. Messika, S. Dolev, and J. Rosen, “Optical binary-matrix synthesis for solving bounded NP-complete combinatorial problems,” Opt. Eng. 46, 108201 (2007).

[CrossRef]

S. Dolev and H. Fitoussi, “Masking traveling beams: optical solutions for NP-complete problems, trading space for time,” Theor. Comput. Sci. 411, 837–853 (2010).

[CrossRef]

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1st ed. (W. H. Freeman, 1979).

S. Goliaei and S. Jalili, “Optical graph 3-colorability,” Lect. Notes Comput. Sci. 6748, 16–22 (2011).

[CrossRef]

S. Goliaei and S. Jalili, “An optical wavelength-based solution to the 3-SAT problem,” Lect. Notes Comput. Sci. 5882, 77–85 (2009).

[CrossRef]

S. Goliaei and S. Jalili, “An optical solution to the 3-SAT problem using wavelength based selectors,” J. Supercomput. (to be published).

S. Goliaei and S. Jalili, “Optical graph 3-colorability,” Lect. Notes Comput. Sci. 6748, 16–22 (2011).

[CrossRef]

S. Goliaei and S. Jalili, “An optical wavelength-based solution to the 3-SAT problem,” Lect. Notes Comput. Sci. 5882, 77–85 (2009).

[CrossRef]

S. Goliaei and S. Jalili, “An optical solution to the 3-SAT problem using wavelength based selectors,” J. Supercomput. (to be published).

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1st ed. (W. H. Freeman, 1979).

V. Koltun and C. H. Papadimitriou, “Approximately dominating representatives,” Theor. Comput. Sci. 371, 148–154 (2007).

[CrossRef]

H. J. Levinson, Proximity X-ray Lithography, 2nd ed. (SPIE, 2005).

X. Zhou, G. Yue, Z. Yang, and K. Li, “A new approach for the dominating-set problem by DNA-based supercomputing,” J. Software 5, 662–670 (2010).

[CrossRef]

N. T. Shaked, T. Tabib, G. Simon, S. Messika, S. Dolev, and J. Rosen, “Optical binary-matrix synthesis for solving bounded NP-complete combinatorial problems,” Opt. Eng. 46, 108201 (2007).

[CrossRef]

N. T. Shaked, S. Messika, S. Dolev, and J. Rosen, “Optical solution for bounded NP-complete problems,” Appl. Opt. 46, 711–724 (2007).

[CrossRef]

S. Misra, I. Woungang, and S. C. Misra, Guide to Wireless Ad Hoc Networks, 2nd ed. (Springer, 2009).

S. Misra, I. Woungang, and S. C. Misra, Guide to Wireless Ad Hoc Networks, 2nd ed. (Springer, 2009).

M. Oltean, “Solving the Hamiltonian path problem with a light-based computer,” Nat. Comput. 7, 57–70 (2008).

[CrossRef]

V. Koltun and C. H. Papadimitriou, “Approximately dominating representatives,” Theor. Comput. Sci. 371, 148–154 (2007).

[CrossRef]

N. T. Shaked, S. Messika, S. Dolev, and J. Rosen, “Optical solution for bounded NP-complete problems,” Appl. Opt. 46, 711–724 (2007).

[CrossRef]

N. T. Shaked, T. Tabib, G. Simon, S. Messika, S. Dolev, and J. Rosen, “Optical binary-matrix synthesis for solving bounded NP-complete combinatorial problems,” Opt. Eng. 46, 108201 (2007).

[CrossRef]

D. E. Tamir, N. T. Shaked, P. J. Wilson, and S. Dolev, “High-speed and low-power electro-optical DSP coprocessor,” J. Opt. Soc. Am. A 26, A11–A20 (2009).

[CrossRef]

N. T. Shaked, S. Messika, S. Dolev, and J. Rosen, “Optical solution for bounded NP-complete problems,” Appl. Opt. 46, 711–724 (2007).

[CrossRef]

N. T. Shaked, T. Tabib, G. Simon, S. Messika, S. Dolev, and J. Rosen, “Optical binary-matrix synthesis for solving bounded NP-complete combinatorial problems,” Opt. Eng. 46, 108201 (2007).

[CrossRef]

N. T. Shaked, T. Tabib, G. Simon, S. Messika, S. Dolev, and J. Rosen, “Optical binary-matrix synthesis for solving bounded NP-complete combinatorial problems,” Opt. Eng. 46, 108201 (2007).

[CrossRef]

N. T. Shaked, T. Tabib, G. Simon, S. Messika, S. Dolev, and J. Rosen, “Optical binary-matrix synthesis for solving bounded NP-complete combinatorial problems,” Opt. Eng. 46, 108201 (2007).

[CrossRef]

S. Misra, I. Woungang, and S. C. Misra, Guide to Wireless Ad Hoc Networks, 2nd ed. (Springer, 2009).

J. Wu, “Extended dominating-set-based routing in ad hoc wireless networks with unidirectional link,” IEEE Trans. Parallel Distrib. Syst. 13, 866–881 (2002).

[CrossRef]

L. Yang, R. Ji, L. Zhang, J. Ding, and Q. Xu, “On-chip CMOS-compatible optical signal processor,” Opt. Express 20, 13560–13565 (2012).

[CrossRef]

C. Qiu and Q. Xu, “Controlling normal incident optical waves with an integrated resonator,” Opt. Express 19, 26905–26910 (2011).

[CrossRef]

X. Zhou, G. Yue, Z. Yang, and K. Li, “A new approach for the dominating-set problem by DNA-based supercomputing,” J. Software 5, 662–670 (2010).

[CrossRef]

X. Zhou, G. Yue, Z. Yang, and K. Li, “A new approach for the dominating-set problem by DNA-based supercomputing,” J. Software 5, 662–670 (2010).

[CrossRef]

X. Zhou, G. Yue, Z. Yang, and K. Li, “A new approach for the dominating-set problem by DNA-based supercomputing,” J. Software 5, 662–670 (2010).

[CrossRef]

J. Wu, “Extended dominating-set-based routing in ad hoc wireless networks with unidirectional link,” IEEE Trans. Parallel Distrib. Syst. 13, 866–881 (2002).

[CrossRef]

X. Zhou, G. Yue, Z. Yang, and K. Li, “A new approach for the dominating-set problem by DNA-based supercomputing,” J. Software 5, 662–670 (2010).

[CrossRef]

S. Goliaei and S. Jalili, “An optical wavelength-based solution to the 3-SAT problem,” Lect. Notes Comput. Sci. 5882, 77–85 (2009).

[CrossRef]

S. Goliaei and S. Jalili, “Optical graph 3-colorability,” Lect. Notes Comput. Sci. 6748, 16–22 (2011).

[CrossRef]

M. Oltean, “Solving the Hamiltonian path problem with a light-based computer,” Nat. Comput. 7, 57–70 (2008).

[CrossRef]

H. J. Caulfield and S. Dolev, “Why future supercomputing requires optics,” Nat. Photonics 4, 261–263 (2010).

[CrossRef]

N. T. Shaked, T. Tabib, G. Simon, S. Messika, S. Dolev, and J. Rosen, “Optical binary-matrix synthesis for solving bounded NP-complete combinatorial problems,” Opt. Eng. 46, 108201 (2007).

[CrossRef]

L. Yang, R. Ji, L. Zhang, J. Ding, and Q. Xu, “On-chip CMOS-compatible optical signal processor,” Opt. Express 20, 13560–13565 (2012).

[CrossRef]

C. Qiu and Q. Xu, “Controlling normal incident optical waves with an integrated resonator,” Opt. Express 19, 26905–26910 (2011).

[CrossRef]

T. Haist, and W. Osten, “An optical solution for the traveling salesman problem,” Opt. Express 15, 10473–10482 (2007).

[CrossRef]

S. Dolev and H. Fitoussi, “Masking traveling beams: optical solutions for NP-complete problems, trading space for time,” Theor. Comput. Sci. 411, 837–853 (2010).

[CrossRef]

V. Koltun and C. H. Papadimitriou, “Approximately dominating representatives,” Theor. Comput. Sci. 371, 148–154 (2007).

[CrossRef]

H. J. Levinson, Proximity X-ray Lithography, 2nd ed. (SPIE, 2005).

S. Misra, I. Woungang, and S. C. Misra, Guide to Wireless Ad Hoc Networks, 2nd ed. (Springer, 2009).

S. Goliaei and S. Jalili, “An optical solution to the 3-SAT problem using wavelength based selectors,” J. Supercomput. (to be published).

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1st ed. (W. H. Freeman, 1979).