Skip to main content
SpringerLink
Log in

An Optical Solution for the SAT Problem

  • Conference paper
Optical Supercomputing (OSC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6748))

Included in the following conference series:

Abstract

We describe a delay-based optical device for solving the the Satisfiability problem. The device has a graph structure which is traversed by light in order to generate a solution. The device has 2 special nodes: a start node (where the initial pulse is sent) and a destination node (where the solution is read). Multiple signals are expected at the destination. Some of them contain valid solutions and others do not. A special, time filter, is proposed in order to detect a solution. Graphical simulations show how the device works.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dolev, S., Fitoussi, H.: The Traveling Beams Optical Solutions for Bounded NP-Complete Problems. In: Crescenzi, P., Prencipe, G., Pucci, G. (eds.) FUN 2007. LNCS, vol. 4475, pp. 120–134. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Garey, M., Johnson, D.: Computers and intractability: A guide to NP-Completeness. Freeman & Co, San Francisco (1979)

    MATH  Google Scholar 

  3. Haist, T., Osten, W.: An Optical Solution For The Traveling Salesman Problem. Opt. Express 15, 10473–10482 (2007)

    Article  Google Scholar 

  4. Haist, T., Osten, W.: An Optical Solution For The Traveling Salesman Problem:erratum. Opt. Express 15, 12627 (2007)

    Article  Google Scholar 

  5. Haist, T., Osten, W.: Ultrafast Digital-Optical Arithmetic Using Wave-Optical Computing. In: Dolev, S., Haist, T., Oltean, M. (eds.) OSC 2008. LNCS, vol. 5172, pp. 33–45. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Haist, T., Osten, W.: Proposal for Secure Key Distribution Using Classical Optics. In: Dolev, S., Oltean, M. (eds.) OSC 2009. LNCS, vol. 5882, pp. 99–101. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Head, T.: Parallel Computing by Xeroxing on Transparencies. Algorithmic Bioprocesses, part 9, 631–637 (2009)

    Article  MathSciNet  Google Scholar 

  8. Head, T.: Using Light to Implement Parallel Boolean Algebra. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 231–242. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  9. Nitta, K., Katsuta, N., Matoba, O.: Improvement of a System for Prime Factorization Based on Optical Interferometer. In: Dolev, S., Oltean, M. (eds.) OSC 2009. LNCS, vol. 5882, pp. 124–129. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Nitta, K., Katsuta, N., Matoba, O.: A Method for Modulo Operation by Use of Spatial Parallelism. In: Dolev, S., Haist, T., Oltean, M. (eds.) OSC 2008. LNCS, vol. 5172, pp. 98–103. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Oltean, M.: A Light-Based Device for Solving the Hamiltonian Path Problem. In: Calude, C.S., Dinneen, M.J., Păun, G., Rozenberg, G., Stepney, S. (eds.) UC 2006. LNCS, vol. 4135, pp. 217–227. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Muntean, O.: Optical Solutions for NP-complete problems, graduation thesis, Faculty of Mathematics and Computer Science, Babes-Bolyai University, Cluj-Napoca, Romania, defended on July 3 (2007)

    Google Scholar 

  13. Oltean, M., Muntean, O.: Solving NP-Complete Problems with Delayed Signals: An Overview of Current Research Directions. In: Dolev, S., Haist, T., Oltean, M. (eds.) OSC 2008. LNCS, vol. 5172, pp. 115–127. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Oltean, M., Muntean, O.: Exact Cover with light. New Generation Computing 26(4) (2008)

    Google Scholar 

  15. Muntean, O., Oltean, M.: Using light for solving the unbounded subset-sum problem. IJICIC 5(8), 2159–2167 (2009)

    MATH  Google Scholar 

  16. Muntean, O., Oltean, O.: Deciding whether a linear Diophantine equation has solutions by using a light-based device. Journal of Optoelectronics and Advanced Materials 11(11), 1728–1734 (2009)

    Google Scholar 

  17. Oltean, M., Muntean, O.: Solving the subset-sum problem with a light-based device. Natural Computing 8(2), 321–331 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  18. Hasan, M. R., Rahman, M.S.: Computing a Solution for the Subset Sum Problem with a Light Based Device. In: Dolev, S., Oltean, M. (eds.) OSC 2009. LNCS, vol. 5882, pp. 70–76. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  19. Shaked, N., Messika, S., Dolev, S., Rosen, J.: Optical solution for bounded NP-complete problems. Applied Optics 46, 711–724 (2007)

    Article  Google Scholar 

  20. Shamir, A.: Factoring large numbers with the TWINKLE device. In: Koç, Ç.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 2–12. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  21. Lenstra, A.K., Shamir, A.: Analysis and optimization of the TWINKLE factoring device. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 35–52. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  22. Goliaei, S., Jalili, S.: An Optical Wavelength-Based Solution to the 3-SAT Problem. In: Dolev, S., Oltean, M. (eds.) OSC 2009. LNCS, vol. 5882, pp. 77–85. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  23. Goliaei, S., Jalili S.: An Optical Solution to the 3-SAT Problem using Wave-length Based Selectors. International Journal of Supercomputing (in press)

    Google Scholar 

  24. Woods, D., Naughton, T.J.: Parallel and Sequential Optical Computing. In: Dolev, S., Haist, T., Oltean, M. (eds.) OSC 2008. LNCS, vol. 5172, pp. 70–86. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  25. Optical simulation for the subset sum problem, http://www.youtube.com/watch?v=moPGLwhm_XM (last accessed on March 17, 2011)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Faculty of Mathematics and Computer Science, Babeş-Bolyai University, Kogălniceanu 1, Cluj-Napoca, 400084, Romania

    Mihai Oltean & Oana Muntean

Authors
  1. Mihai Oltean
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oana Muntean
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Ben Gurion University of Negev, Beer-Sheva, Israel

    Shlomi Dolev

  2. Babes-Bolyai University, Cluj-Napoca, Romania

    Mihai Oltean

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Oltean, M., Muntean, O. (2011). An Optical Solution for the SAT Problem. In: Dolev, S., Oltean, M. (eds) Optical Supercomputing. OSC 2010. Lecture Notes in Computer Science, vol 6748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22494-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22494-2_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22493-5

  • Online ISBN: 978-3-642-22494-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation