you: i wonder if this problem is NP-complete? me: actually a trivial subproblem of it, which seems easy, is NP-complete on its ownpic.twitter.com/miSLFHswsq
You can add location information to your Tweets, such as your city or precise location, from the web and via third-party applications. You always have the option to delete your Tweet location history. Learn more
I understood the problem of optimal rearrangement in terms of equivalence...
i work on graphics, so "equivalence" means "within some reasonable epsilon on our test shaders"
i'm part of the cabal that tells people to never use == on floats
fun fact: there's a GPU where in some cases (max(a,b) == a || max(a,b) == b) returns false for non-NaN inputs
(this is a good story, if anyone cares)
Yes please!
Thank you!
Keep in min @FioraAeterna lives in GPU land where no one cares about the low ~20 bits (except when they do).
Errors from overflow are generally infinite in magnitude though. :-)
Not if you're using round-to-zero! Okay, admittedly, the latest GPU release now uses RTNE so we don't have that excuse anymore.
/Pours one out for the "compute some of the full product, skip some carries out of the low part, leave a couple extra bits and round" mode/
*ahem* ROUND TO BEST EFFORT
reminder this is a real phrase from a real spec
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.