Comment Re:CRC (Score 1) 440
[citation needed]
A bug in your script is far more likely than a collision between two files in full 128 bit md5, barring a deliberate attack on md5 to create the collision.
[citation needed]
A bug in your script is far more likely than a collision between two files in full 128 bit md5, barring a deliberate attack on md5 to create the collision.
Cracking a key is NP hard
No it isn't. It might not be in P, but it almost certainly is not NP hard. (Barring something like P=NP that would imply everything in P is NP hard)
This result was rather interesting for SODA because it wasn't an improvement in time complexity over the best known algorithm. There are asymptotically faster previously known algorithms for computing sparse FFTs, but they aren't actually faster than the current (extremely optimized) FFT implementations unless the output is extremely sparse.
This algorithm isn't quite as asymptotically fast but it has a much better constant factor, so it is more likely to be effective in practice on inputs which are not extremely large and/or outputs which are not extremely sparse.
Posting a story about how a presentation will be given at SODA... about a day after SODA ended.
I actually went to this talk, which was scheduled for the first 8:30 AM timeslot as part of their evil conspiracy to get me to wake up early. The approach seemed remarkably straightforward, but I haven't gotten around to actually reading the paper yet -- I was too busy sightseeing around Kyoto.
will probably cause the premature deaths of several times that number
[citation needed]
(see: guardian.co.uk)
[lol]
"If I do not want others to quote me, I do not speak." -- Phil Wayne