Re:Is Complexity Theory On The Brink?
by jules on Friday November 26, 2010 @01:31PM
(#1942928)
Proving lower bounds on complexity and inventing algorithms that have theoretically better complexity but are most times useless in practice (for example the O(n^2.376) algorithm for matrix multiplication).
[ Parent
| on HN ]
There are no comments on this comment yet.