Finding prime numbers (the basement of the encryptions algorithms) is a NP problem. But it is too in the Co-NP class.
This is very important, because all of the problems that were in both classes in the past are really P problem !
So... the only one problem that is at the present in both NP and Co-NP classes is the primality problem !!!
Brrrr.....:)
How long takes to fix the free browsers...
Amnesty? A good start could be stop calling "pirates" to the owners of Microsoft's software unlicensed copies.
Try again, Microsoft. ;)
"FF 0.9 trashed my profile" "Oh... my bookmarks are gone" blah, blah, blah.
;)
Have you had to wait 0.9 to say it? Why you don't said all this in 0.9RC1 ????
OK. Now... I'll try to find my bookmarks on some old backup.
Edsger W. Dijkstra wrote an article about the next fifty years in computer sciences (twenty years ago).
So, I think this apply to this thread ;)
http://www.smaldone.com.ar/documentos/ewd/EWD1243a _pretty.html
Happy birthday.
And thanks for all!!!
Finding prime numbers (the basement of the encryptions algorithms) is a NP problem. But it is too in the Co-NP class. This is very important, because all of the problems that were in both classes in the past are really P problem ! So... the only one problem that is at the present in both NP and Co-NP classes is the primality problem !!! Brrrr..... :)