@tom_forsyth It did not end well for NP. We never could decide whether traveling salesman was in it or not :(
@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... -
@cmuratori@tom_forsyth really the size of the whole problem representation. If the edge weights were of the order O(2^(2^n)) then the...
End of conversation
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.