Eric Bach is an American computer scientist who has made contributions to computational number theory.
Eric Bach | |
|---|---|
| Born | November, Chicago, Illinois, U.S. |
| Alma mater | University of California - Berkeley University of Michigan |
| Scientific career | |
| Fields | Computer Science |
| Institutions | University of Wisconsin - Madison |
| Doctoral advisor | Manuel Blum |
| Doctoral students | John Watrous Victor Shoup |
Bach completed his undergraduate studies at the University of Michigan, Ann Arbor, and got his Ph.D. in computer science from the University of California, Berkeley, in 1984 under the supervision of Manuel Blum.[1] He is currently a professor at the Computer Science Department, University of Wisconsin–Madison.
Among other work, he gave explicit bounds for the Chebotarev density theorem, which imply that if one assumes the generalized Riemann hypothesis then is generated by its elements smaller than 2(log n)2.[2] This result shows that the generalized Riemann hypothesis implies tight bounds for the necessary run-time of the deterministic version of the Miller–Rabin primality test. Bach also did some of the first work on pinning down the actual expected run-time of the Pollard rho method where previous work relied on heuristic estimates and empirical data.[3] He is the namesake of Bach's algorithm for generating random factored numbers.
References
edit- ^ "Eric Bach". ACM SIGACT Theoretical Computer Science genealogy database. Archived from the original on November 27, 2005. Retrieved 2008-06-04.
- ^ Bach, Eric (1990), "Explicit bounds for primality testing and related problems", Mathematics of Computation, 55 (191): 355–380, doi:10.2307/2008811, JSTOR 2008811
- ^ Bach, Eric (1991). "Toward a theory of Pollard's rho method" (PDF). Information and Computation. 90 (2): 139–155. doi:10.1016/0890-5401(91)90001-i. Retrieved March 4, 2015.
   | This article about an American mathematician is a stub. You can help Wikipedia by expanding it. |