Looking on the internet deeply has found these results:

the complexity of the algorithm is linear is the most popular phrase on the web.

sending smaller number of 13 results on the web	the complexity of the algorithm is linear 12,170 results on the web More popular!
Some examples and use cases from the internet:	Some examples and use cases from the internet:
cycle values result in sending smaller number of copies or less retransmissions. As S process and regularly followed by sending smaller number of data media packets to client. On W ARQ wastes half of the awake mode time waiting for Acks,. READ+ has�... demand streaming traffic did not send data in all along display�... Aug 17, 2011 ... of small packets compared to sending smaller number of big packets (to verfiy this we would have to see internals/source code of the MPI�...	Dec 6, 2011 ... "Almost linear" here means that the complexity of the algorithm is linear in the size of the hypergraph up to a factor alpha(n), where alpha is the�... In practice, the complexity of the algorithm is linear with respect to the size of the sample space. The algorithm starts from a feasible solution of the problem and. The complexity of the algorithm is linear in the length of the patterns plus the length of the searched text plus the number of output matches. Note that because all�... In practice, the complexity of the algorithm is linear with respect to the size of the sample space. The algorithm starts from a feasible solution of the problem.

sending smaller number of

13 results on the web

the complexity of the algorithm is linear

12,170 results on the web

More popular!

cycle values result in sending smaller number of copies or less retransmissions. As S
process and regularly followed by sending smaller number of data media packets to client. On
W ARQ wastes half of the awake mode time waiting for Acks,. READ+ has�...
demand streaming traffic did not send data in all along display�...
Aug 17, 2011 ... of small packets compared to sending smaller number of big packets (to verfiy this we would have to see internals/source code of the MPI�...

Dec 6, 2011 ... "Almost linear" here means that the complexity of the algorithm is linear in the size of the hypergraph up to a factor alpha(n), where alpha is the�...
In practice, the complexity of the algorithm is linear with respect to the size of the sample space. The algorithm starts from a feasible solution of the problem and.
The complexity of the algorithm is linear in the length of the patterns plus the length of the searched text plus the number of output matches. Note that because all�...
In practice, the complexity of the algorithm is linear with respect to the size of the sample space. The algorithm starts from a feasible solution of the problem.