{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:35:31Z","timestamp":1743042931165,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642224935"},{"type":"electronic","value":"9783642224942"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22494-2_10","type":"book-chapter","created":{"date-parts":[[2011,7,13]],"date-time":"2011-07-13T04:30:30Z","timestamp":1310531430000},"page":"86-99","source":"Crossref","is-referenced-by-count":0,"title":["Nanotechnology Based Optical Solution for NP-Hard Problems"],"prefix":"10.1007","author":[{"given":"Eyal","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shlomi","family":"Dolev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Frenkel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rami","family":"Puzis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Rosenblit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Anter, A., Dolev, S.: Optical solution for hard on average #P-complete instances. Natural Computing (2010)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proc. of the 3rd Ann. ACM Symp. On Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1016\/j.tcs.2009.06.030","volume":"411","author":"S. Dolev","year":"2010","unstructured":"Dolev, S., Fitoussi, H.: Masking traveling beams: Optical solutions for NP-complete problems, trading space for time. Theoretical Comp. Science\u00a0411, 837 (2010)","journal-title":"Theoretical Comp. Science"},{"key":"10_CR4","unstructured":"Dolev, S., Fitoussi, H.: Primitive Operations for Graph-Optical Processor. In: 6th Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms (May 2006)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Dolev, S., Fitoussi, H.: The Traveling Beams: Optical Solutions for Bounded NP-Complete Problems, Technical report #07-04, Ben Gurion University of the Negev (January 2007)","DOI":"10.1007\/978-3-540-72914-3_12"},{"key":"10_CR6","unstructured":"Dolev, S., Korach, E., Uzan, G.: A Method for Encryption and Decryption of Messages, PCT Patent Application WO 2006\/001006 (January 2006)"},{"key":"10_CR7","unstructured":"Dolev, S., Yuval, N.: Optical implementation of bounded non-deterministic Turing machines, US Patent 7,130,093 B2, January 2005, Filed (May 2004)"},{"key":"10_CR8","volume-title":"Optical Computing: A Survey for Computer Scientists","author":"G. Feitelson","year":"1988","unstructured":"Feitelson, G.: Optical Computing: A Survey for Computer Scientists. MIT Press, Cambridge (1988)"},{"key":"10_CR9","volume-title":"Computers and Intractability, a guide to the theory of NP completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, a guide to the theory of NP completeness. W. H. Freeman and Company, San Francisco (1979)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Gutfreund, D., Shaltiel, R., Ta-Shma, A.: If NP Languages are Hard on the Worst-Case, then it is easy to find their Hard Instances. Journal of Computational Complexity (2007)","DOI":"10.1007\/s00037-007-0235-8"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"10473","DOI":"10.1364\/OE.15.010473","volume":"15","author":"T. Haist","year":"2007","unstructured":"Haist, T., Osten, W.: An Optical Solution For The Traveling Salesman Problem. Opt. Express\u00a015, 10473\u201310482 (2007)","journal-title":"Opt. Express"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An algorithm for maximum matching in bipartite graphs. SIAM J. Computing\u00a02, 225\u2013231 (1973)","journal-title":"SIAM J. Computing"},{"key":"10_CR13","volume-title":"Charles Babbage: Pioneer of the Computer","author":"A. Hyman","year":"1982","unstructured":"Hyman, A.: Charles Babbage: Pioneer of the Computer. Princeton University Press, Princeton (1982)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibilty among combinatorial problems. Complexity of Computer Computations, 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10_CR15","unstructured":"Lenslet LTD, http:\/\/www.hpcwire.com\/hpcwire\/hpcwireWWW\/03\/1017\/106185.html"},{"key":"10_CR16","unstructured":"Mann, H.J., Ulrich, W., Seitz, G.: 8-Mirror microlithography projection objective, US Patent 2004\/0012866 A1, January 2004, Filed (April 2003)"},{"key":"10_CR17","volume-title":"Optical computer architectures","author":"A.D. McAulay","year":"1991","unstructured":"McAulay, A.D.: Optical computer architectures. John Wiley, Chichester (1991)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11839132_18","volume-title":"Unconventional Computation","author":"M. Oltean","year":"2006","unstructured":"Oltean, M.: A Light-Based Device for Solving the Hamiltonian Path Problem. In: Calude, C.S., Dinneen, M.J., P\u0103un, G., Rozenberg, G., Stepney, S. (eds.) UC 2006. LNCS, vol.\u00a04135, pp. 217\u2013227. Springer, Heidelberg (2006)"},{"key":"10_CR19","volume-title":"Natural Computing","author":"M. Oltean","year":"2007","unstructured":"Oltean, M., Muntean, O.: Solving the subset-sum problem with a light-based device. In: Natural Computing, Springer, Heidelberg (2007)"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1364\/AO.46.000711","volume":"46","author":"N.T. Shaked","year":"2007","unstructured":"Shaked, N.T., Messika, S., Dolev, S., Rosen, J.: Optical solution for Bounded NP-Complete Problems. Journal of App. Optics\u00a046, 711 (2007)","journal-title":"Journal of App. Optics"},{"key":"#cr-split#-10_CR21.1","doi-asserted-by":"crossref","unstructured":"Reif, J.H., Tygar, D., Yoshida, A.: The Computability and Complexity of Optical Beam Tracing. In: 31st Annual IEEE Symposium on Foundations of Computer Science, pp. 106-114 (1990)","DOI":"10.1109\/FSCS.1990.89529"},{"key":"#cr-split#-10_CR21.2","doi-asserted-by":"crossref","unstructured":"Also The Computability and Complexity of Ray Tracing. Discrete and Computational Geometry\u00a011, 265-287 (1994)","DOI":"10.1007\/BF02574009"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-85673-3_5","volume-title":"Optical SuperComputing","author":"D.E. Tamir","year":"2008","unstructured":"Tamir, D.E., Shaked, N.T., Wilson, P.J., Dolev, S.: Electro-Optical DSP of Tera Operations per Second and Beyond (Extended Abstract). In: Dolev, S., Haist, T., Oltean, M. (eds.) OSC 2008. LNCS, vol.\u00a05172, pp. 56\u201369. Springer, Heidelberg (2008)"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"van Emde Boas, P.: Machine Models and Simulation. In: Volume, A. (ed.) Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) pp. 1\u201366 (1990)","DOI":"10.1016\/B978-0-444-88071-0.50006-0"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/11839132_4","volume-title":"Unconventional Computation","author":"D. Woods","year":"2006","unstructured":"Woods, D.: Optical Computing and Computational Complexity. In: Calude, C.S., Dinneen, M.J., P\u0103un, G., Rozenberg, G., Stepney, S. (eds.) UC 2006. LNCS, vol.\u00a04135, pp. 27\u201340. Springer, Heidelberg (2006)"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/11560319_22","volume-title":"Unconventional Computation","author":"D. Woods","year":"2005","unstructured":"Woods, D., Gibson, J.P.: Lower Bounds on the Computational Power of an Optical Model of Computation. In: Calude, C.S., Dinneen, M.J., P\u0103un, G., Jes\u00fas P\u00e9rez-J\u00edmenez, M., Rozenberg, G. (eds.) UC 2005. LNCS, vol.\u00a03699, pp. 237\u2013250. Springer, Heidelberg (2005); Journal version, Natural Computing 79(1), 95\u2013108 (2008)"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","first-page":"95","volume-title":"Unconventional Computation","author":"W. Xiajun","year":"2005","unstructured":"Xiajun, W., Zhao, X., Bermak, A., Boussaind, F.: An AER based CMOS Polarization Image Sensor with Photo-aligned Micropolarizer Array. In: Calude, C.S., Dinneen, M.J., P\u0103un, G., Jes\u00fas P\u00e9rez-J\u00edmenez, M., Rozenberg, G. (eds.) UC 2005. LNCS, vol.\u00a03699, pp. 95\u2013108. Springer, Heidelberg (2005); Journal version. Natural Computing \u00a07(1), 95\u2013108 (2008)"}],"container-title":["Lecture Notes in Computer Science","Optical Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22494-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T02:20:19Z","timestamp":1741314019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22494-2_10"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642224935","9783642224942"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22494-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}