I have every confidence in Gary Miller. The actual paper is available from the link below, or directly from: http://www.cs.cmu.edu/~glmiller/Publications/Papers/KoutisApproaching-2010.p... Interestingly, _planar graphs_ play a part in this paper! Who knew that linear algebra & planar graphs were connected ? I guess the next practical question is whether this algorithm can be parallelized to any significant degree. At 07:28 AM 10/22/2010, Simon Plouffe wrote:
Hello,
some people at Carnegie Mellon found a way to speed up a lot linear equations :
http://www.cmu.edu/news/archive/2010/October/oct21_speedyalgorithm.shtml
if true, this is going to be interesting for many algorithms.
I did not verified, it is certainly worth a lookup,
have a nice day, best regards,
simon plouffe