Seinosuke Toda
Jump to navigation
Jump to search
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 Archived 2007-08-18 at the Wayback Machine at the Nihon University.
- ^ Seinosuke Toda at the Mathematics Genealogy Project
- ^ "1998 Gödel Prize". www.sigact.org. Retrieved 2010-12-05.
Categories:
- Webarchive template wayback links
- Articles with short description
- Short description matches Wikidata
- Articles containing Japanese-language text
- Articles with ISNI identifiers
- Articles with VIAF identifiers
- Articles with NDL identifiers
- Articles with DBLP identifiers
- Articles with MATHSN identifiers
- Articles with MGP identifiers
- Articles with ZBMATH identifiers
- Japanese computer scientists
- 20th-century Japanese mathematicians
- 21st-century Japanese mathematicians
- Theoretical computer scientists
- Gödel Prize laureates
- 1959 births
- Living people
- Academic staff of Nihon University
- All stub articles
- Computer scientist stubs