Association Mission
The mission of the association is to advance the creation, communication and application of knowledge to benefit society and improve people's lives.
Legal Members
Membership
Contact Us
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Manafi Moorkani A, Jalili S, Mohabbati M. A light-based solution to the Subset-sum problem. ICOP & ICPET _ INPC _ ICOFS 2014; 20 :949-952
URL: http://opsi.ir/article-1-382-en.html
URL: http://opsi.ir/article-1-382-en.html
Abstract: (4281 Views)
There are many NP-complete problems in computer science, so far the polynomial-time algorithms for their solution are not provided. In this paper, we simulate the subset-sum problem using optical elements. The idea of solving this problem is based on the properties of the light frequency. In this approach, the sum of all subsets of given set are generated using the frequency shifter. Finally, the problem has solution when the light gets out has the frequency equals to the sum of frequency of the primary beam and a given number S. To solve this problem the time and resource complexity is in order of polynomial.
Keywords: Unconventional computing, Light-based computing, NP-Complete problems, Frequency shifter, Subset-sum problem
Send email to the article author
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
