Seinosuke Toda

Seinosuke Toda (戸田 誠之助 Toda Seinosuke, born January 15, 1959) is a computer scientist working at the Nihon University in Tokyo.[1] Toda earned his Ph.D. from the Tokyo Institute of Technology in 1992, under the supervision of Kojiro Kobayashi.[2] He was a recipient of the 1998 Gödel Prize for proving Toda's theorem in computational complexity theory, which states that every problem in the polynomial hierarchy has a polynomial-time Turing reduction to a counting problem.[3]

Notes

  1. ↑ S. Toda at the Nihon University.
  2. ↑ Seinosuke Toda at the Mathematics Genealogy Project
  3. ↑ "1998 Gödel Prize". www.sigact.org. Retrieved 2010-12-05.


This article is issued from Wikipedia - version of the 2/22/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.