Seinosuke Toda (born January 15, 1959) is a computer scientist working at Nihon University in Tokyo. He earned his PhD from the Tokyo Institute of Technology in 1992 under Kojiro Kobayashi, and received the 1998 Godel 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.
Facts
Sources
1. Wikipedia: Seinosuke Toda
Lead sentence, birth date
Seinosuke Toda (戸田 誠之助, Toda Seinosuke; born January 15, 1959) is a computer scientist working at the Nihon University in Tokyo.
Lead sentence, birth year
Seinosuke Toda (戸田 誠之助, Toda Seinosuke; born January 15, 1959) is a computer scientist working at the Nihon University in Tokyo.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.