Assertion: algorithm | /r/HasAspect | maximum possible speedup
Facets:
value: on any real computer
type: LOCATION
Source sentences:
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.