News for hackers. Stuff that matters.
Re:What algorithm blows your mind? (Reddit compsci) by mikleb on Tuesday October 26, 2010 @06:26AM (#1833676)
But maximal matroid matching is NP-hard. ;)

Approximating the minimum spaning tree weight in subliner time is very unexpected algorithm.

There are no comments on this comment yet.