To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
P vs NP |
|
Author |
Gilberto Rodrigo Diduch |
| Citation |
Vol. 12 No. 1 pp. 165-167 |
|
Abstract |
Cryptanalysis can take long time, is it possible to make it faster, in Turing Polynomial Time? The question about processing huge data amount in a short time remains for decades, what took us to the dilemma P vs NP, and now I am pleased to say that the search is finally completed, P is not equal to NP. |
|
Keywords |
Turing, Machines, Cryptanalysis, P vs NP and Solution |
|
URL |
