Seinosuke Toda
Japanese computer scientist
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
- v
- t
- e
Gödel Prize laureates
- Vardi / Wolper (2000)
- Arora / Feige / Goldwasser / Lund / Lovász / Motwani / Safra / Sudan / Szegedy (2001)
- Sénizergues (2002)
- Freund / Schapire (2003)
- Herlihy / Saks / Shavit / Zaharoglou (2004)
- Alon / Matias / Szegedy (2005)
- Agrawal / Kayal / Saxena (2006)
- Razborov / Rudich (2007)
- Teng / Spielman (2008)
- Reingold / Vadhan / Wigderson (2009)
P ≟ NP | This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it. |
- v
- t
- e