Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

Asymmetric cryptographic algorithms

Name: Anonymous 2011-07-16 18:04

Is it possible for any of them to survive to P=NP, assuming that NP-complete O(2N) problems collapse to at best O(N2)?

Name: Anonymous 2011-07-18 7:49

>>17
The rest was just a remark.
You fundamentally misunderstand how discussion works, you poor autism. When someone asks "Is XYZ possible", the "No. Unrelated fact." is not a valid answer, even if XYZ indeed turns out to be impossible. Bare assertions add nothing to the discussion, neither the explanation why XYZ is impossible, nor even any confidence that XYZ is in fact impossible since you can be a lying autistic nigger.

>>18 Polynomial differences are usually disregarded, for obvious reasons. There is an intriguing possibility that the polynomial in question has a really really big degree, but that's not what OP asked.

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List