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
Connections
In Field
Source Wikipedia: Seinosuke Toda
In the Other Atlases
Milestones Credited
Also in Mathematics Atlas: a milestone credited to this subject.
Nationality
Also in Geography Atlas: the nationality of this subject.
Sources
1. Wikidata: Seinosuke Toda
- Wikidata Q8190500, class allow-list match (w-wdresolver-0926)
- Wikidata Q8190500 P569 (date of birth)
2. 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.
In Field: Algorithms and Complexity Theory, Lead
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.
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.