Paul Zimmermann
From Wikipedia, the free encyclopedia
For the American sportswriter, see Paul Zimmerman
Paul Zimmermann is a French computational mathematician, working at INRIA.
His home page is [1]
His interests include asymptotically-fast arithmetic - he is writing a book on algorithms for computer arithmetic with Richard Brent. He has developed some of the fastest available code for manipulating polynomials over GF(2), and for calculating hypergeometric constants to billions of decimal places. He is presently associated with the CACAO project to develop efficient arithmetic, in a general context and in particular in the context of algebraic curves of small genus; arithmetic on polynomials of very large degree turns out to be useful in algorithms for point-counting on such curves.
Zimmermann's Erdős number is 2.
 |
This article about a European mathematician is a stub. You can help Wikipedia by expanding it. |
