[Computational Complexity] Fulkerson Prize
The winners of the 2006 Fulkerson Prize have been announced. The Fulkerson prize is given every three years to up to three papers in discrete mathematics.
- Primes in P, Manindra Agrawal, Neeraj Kayal and Nitin Saxena
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries, Mark Jerrum, Alistair Sinclair and Eric Vigoda.
- Graph Minors. XX. Wagner's conjecture, Neil Robertson and Paul Seymour.
I disagree with Luca and Oded on awards. While theory is a team sport, we do like ways to recognize the very best work and individuals in our field. And awards get us talking about the best work. Even when we don't agree with the winners, the discussions that follow help us understand what we think is important.