Just what I want, a fireplug-high gizmo flying
down the hall at 20+ MPH. At least this way it
will injure you uniformly all over instead of knocking your
feet out from under you and breaking your neck.
I'm guessing they'll end up with some
injuries if they ever set the speed up to eleven....
Just about the first thing in the documentation is
a note that since all TLAs have already been used several times, you'll just have to live with the CSS collision. He mentions both previously-noted prior uses of "CSS".
Why, if they could build a kite without modern
materials, they could build a man-carrying
glider just using wood and linen! And everyone knowns that wood and linen weren't around in
ancient Egypt. All they had was rocks and beer,
based on my exhaustive study of the relevant earlier postings.
Except for the engines, the earliest aircraft
were largely wood and linen. Materials aren't a
good reason to conclude this wasn't done. However, the fact that nothing was recorded about it is a pretty good reason....
That Python URL (which for obvious reasons
I'm not repeating) is one of the ones that pops
up a hidden ad box. Nice. I was wondering
if I'd ever get to see one. I hope you negotiated
a good price.
Side note: there were some teenagers in the theater I was in who were talking, and I simply got up and walked
right over to them (I could barely contain my anger) and asked them (politely, mind you) to "be quiet, please".
Everyone else must see movies in another universe than me. When I go (very infrequently), the sound is so over-pumped that couldn't hear
a hundred people on cell phones at once. In fact,
that's why I usually don't go to movies. I guess I should just wear earplugs, but just not going is a lot cheaper....
Re:Implications to Cryptography
on
Does P = NP?
·
· Score: 1
Therefore, even if this works, solving the discrete log problem or factoring would probably still be in something like
O(((((n^2)^7)^3)^5)^6) time!
Sorry, dude, but you should be adding these. If it takes O(n^6) time to convert each way, and we go through 3 conversions, then the cost is 7*O(n^6) (six conversions, one solution).
And as we all know, 7*O(n^6) = O(n^6).
So you're off by a back-of-envelope factor of n^1254....
Why wouldn't the existance of a P time algorithm simply show that this particular problem was misgrouped?
I'm not a CS grad student, but I was once. A large number of NP problems have been shown to be equivalant. If any of them are shown to be in P, then all the other have, too. I *believe* (read--haven't studied this for a long time) that
all the NP-complete problems have been shown to be equivalent.
Slashdot Mirror
Gee, I thought the sales tax took care of that. No, the previous posters are correct: it's just taking advantage of peoples' innumeracy.
Just what I want, a fireplug-high gizmo flying down the hall at 20+ MPH. At least this way it will injure you uniformly all over instead of knocking your feet out from under you and breaking your neck.
I'm guessing they'll end up with some injuries if they ever set the speed up to eleven....
Just about the first thing in the documentation is a note that since all TLAs have already been used several times, you'll just have to live with the CSS collision. He mentions both previously-noted prior uses of "CSS".
Except for the engines, the earliest aircraft were largely wood and linen. Materials aren't a good reason to conclude this wasn't done. However, the fact that nothing was recorded about it is a pretty good reason....
That Python URL (which for obvious reasons I'm not repeating) is one of the ones that pops up a hidden ad box. Nice. I was wondering if I'd ever get to see one. I hope you negotiated a good price.
Everyone else must see movies in another universe than me. When I go (very infrequently), the sound is so over-pumped that couldn't hear a hundred people on cell phones at once. In fact, that's why I usually don't go to movies. I guess I should just wear earplugs, but just not going is a lot cheaper....
Sorry, dude, but you should be adding these. If it takes O(n^6) time to convert each way, and we go through 3 conversions, then the cost is 7*O(n^6) (six conversions, one solution).
And as we all know, 7*O(n^6) = O(n^6). So you're off by a back-of-envelope factor of n^1254....
I'm not a CS grad student, but I was once. A large number of NP problems have been shown to be equivalant. If any of them are shown to be in P, then all the other have, too. I *believe* (read--haven't studied this for a long time) that all the NP-complete problems have been shown to be equivalent.