|
|
|
|
|
|
by jpster
722 days ago
|
|
|
> A glance at the raw figures shows just how far we have come: until the turn of the millennium, no algorithm managed to compute faster than m1.5, where m stands for the number of connections in a network that the computer has to calculate, and just reading the network data once takes m time. In 2004, the computing speed required to solve the problem was successfully reduced to m1.33. Using Kyng’s algorithm, the “additional” computing time required to reach the solution after reading the network data is now negligible. TFA didn’t describe Kyng’s breakthrough in terms of this mscore it considers so important. What’s up with that? |
|
|