An algorithm is said to run in polylogarithmic time if T(n) = O((log n)k), for some constant k. For example, matrix chain ordering can be solved in polylogarithmic time on a Parallel Random Access Machine.
Read more about this topic: Time Complexity
Famous quotes containing the word time:
“... the only way in which Mr. Brooke could be coerced into thinking of the right arguments at the right time was to be well plied with them till they took up all the room in his brain. But here there was the difficulty of finding room, so many things having been taken in beforehand. Mr. Brooke himself observed that his ideas stood rather in his way when he was speaking.”
—George Eliot [Mary Ann (or Marian)
Related Phrases
Related Words