Assertion: algorithm | /r/CapableOf | take time
Facets:
value: on the order of n3
type: OTHER
Source sentences:
text: Directly applying the mathematical definition of matrix multiplication gives an algorithm that takes time on the order of n3 to multiply two n × n matrices (Θ(n3) in big O notation).
text: This algorithm has a critical path length of Θ(log2 n) steps, meaning it takes that much time on an ideal machine with an infinite number of processors; therefore, it has a maximum possible speedup of Θ(n3/log2 n) on any real computer.
text: This algorithm takes time Θ(nmp)