@handmade_hero Oh. Oh dis gonna be gooooooood <grabs popcorn>
@Uberstedt @tom_forsyth Or in other words, someone can set the total path weights to something larger than 2^(2^n), couldn't they?
-
-
@Uberstedt@tom_forsyth Then it is no longer verifiable in O(n^x)... know what I mean? -
@cmuratori@tom_forsyth I believe that the N (problem size) in the complexity context is not simply the number of nodes in the graph, but... - Show replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.