231 - Order Notationhttp://youtu.be/jo9rfWct1OI?a
@Uberstedt @tom_forsyth ... and binary search in O(log total), that seems P. Although, the total is not related to n, but presumably OK?
-
-
@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? - 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.