Seinosuke Toda
From Infogalactic: the planetary knowledge core
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
- ↑ S. Toda at the Nihon University.
- ↑ Seinosuke Toda at the Mathematics Genealogy Project
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
<templatestyles src="Asbox/styles.css"></templatestyles>
