big O works for concurrent also,
所有跟贴·加跟贴·新语丝读书论坛
送交者: steven 于 2011-02-24, 02:50:15:
回答: because of the concurrency issues. Unless the algorithm 由 ak70 于 2011-02-24, 02:33:08:
say a problem can be solve in O(log n) time with O(n^k) processors. That is pretty straightforward, isn't it?
所有跟贴:
加跟贴