An Optical WavelengthBased Solution to the 3SAT Problem
Abstract
The NPcomplete is a class of complexity including many realworld problems. Although many efforts made to find efficient solutions to NPcomplete problems, no such a solution having polynomial complexity of used resources is found yet.
 Publication:

Lecture Notes in Computer Science
 Pub Date:
 2009
 DOI:
 10.1007/9783642104428_10
 Bibcode:
 2009LNCS.5882...77G
 Keywords:

 Optical Computing;
 WavelengthBased Approach;
 NP Complete;
 3SAT Problem;
 Unconventional Computing