An optical wavelength-based solution to the 3-SAT problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5882 LNCS, Issue , 2009, Pages 77-85

  Goliaei, Sama ^a   Jalili, Saeed ^a  

^a TARBIAT MODARES UNIVERSITY   (Iran)

Author keywords

3 SAT Problem; NP Complete; Optical Computing; Unconventional Computing; Wavelength Based Approach

Indexed keywords

BOOLEAN VARIABLES; CONTINUOUS SPACE MACHINE; EXPONENTIAL NUMBERS; LIGHT RAYS; NP COMPLETE; NP COMPLETE PROBLEMS; OPTICAL COMPUTING; OPTICAL MASK; OPTICAL WAVELENGTH; POLYNOMIAL COMPLEXITY; POLYNOMIAL-TIME; PREPROCESSING PHASE; REAL-WORLD PROBLEM; SAT PROBLEMS; UNCONVENTIONAL COMPUTING;

CARBON NANOFIBERS; COMPUTER SCIENCE; OPTICAL DATA PROCESSING; OPTICAL FILTERS; OPTICAL INSTRUMENTS; POLYNOMIAL APPROXIMATION; WAVELENGTH;

OPTICAL PROPERTIES;

EID: 70549102310     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10442-8_10     Document Type: Conference Paper

References (13)

1. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the third annual ACM symposium on Theory of computing, Shaker Heights, Ohio, United States, pp. 151-158. ACM, New York (1971)
2. Rintanen, J., Heljanko, K., Niemel, I.: Planning as satisfiability: parallel plans and algorithms for plan search. Artificial Intelligence 170(12-13), 1031-1080 (2006)
3. Amla, N., Du, X., Kuehlmann, A., Kurshan, R.P., McMillan, K.L.: An analysis of SAT-Based model checking techniques in an industrial environment. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol. 3725, pp. 254-268. Springer, Heidelberg (2005)
4. Oltean, M., Muntean, O.: Exact cover with light. 0708.1962 (August 2007). In: New Generation Computing, vol. 26(4), pp. 327-344. Springer, Heidelberg (2008)
5. Oltean, M.: Solving the hamiltonian path problem with a light-based computer. Natural Computing: an international journal 7(1), 57-70 (2008)
6. Oltean, M., Muntean, O.: Solving the subset-sum problem with a light-based device. Natural Computing: an international journal 8(2), 321-331 (2009)
7. Haist, T., Osten, W.: An optical solution for the traveling salesman problem. Optics Express 15(16), 10473-10482 (2007) PMID: 19547400.
8. 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)
9. Shaked, N.T., Tabib, T., Simon, G., Messika, S., Dolev, S., Rosen, J.: Optical binary-matrix synthesis for solving bounded NP-complete combinatorial problems. Optical Engineering 46(10), 108-201 (2007)
10. Shaked, N.T., Messika, S., Dolev, S., Rosen, J.: Optical solution for bounded NP-complete problems. Applied Optics 46(5), 711-724 (2007) PMID: 17279159.
11. Woods, D., Gibson, J.: Lower bounds on the computational power of an optical model of computation. Natural Computing 7(1), 95-108 (2008)
12. Woods, D., Naughton, T.J.: An optical model of computation. Theor. Comput. Sci. 334(1-3), 227-258 (2005)
13. Woods, D., Naughton, T.: Parallel and sequential optical computing. In: Dolev, S., Haist, T., Oltean, M. (eds.) OSC 2008. LNCS, vol. 5172, pp. 70-86. Springer, Heidelberg (2008)