Abstract
In this paper, we have used optics to solve the satisfiability problem. The satisfiability problem is a well-known NP-complete problem in computer science, having many real world applications, which no polynomial resources solution is found for it, yet. The provided method in this paper, is based on forming patterns on photographic films iteratively to solve a given satisfiability problem in efficient time. The provided method requires polynomial time, but, exponential length films and exponential amount of energy to solve the satisfiability problem. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Goliaei, S., & Jalili, S. (2013). An optical polynomial time solution for the satisfiability problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7715 LNCS, pp. 15–24). https://doi.org/10.1007/978-3-642-38250-5_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
