# Seinosuke Toda

> Seinosuke Toda  is a computer scientist working at the Nihon University in Tokyo. Toda earned his Ph.D. from the Tokyo Institute of Technology in 1992, under the supervision of Kojiro Kobayashi. 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.

*Japanese computer scientist*

**Canonical URL:** https://fame.am/person/seinosuke-toda

## Identity
- **Profile type:** Academic ([Wikidata](https://www.wikidata.org/entity/Q39631))
- **Category:** Academics
- **Country:** Japan
- **Born:** 1959-01-15
- **Status:** living
- **Gender:** male

## Bio

Imported from discovery source: wikidata-dump

## Fame
- **Popularity score:** 40.0 / 100
- **Momentum:** 3.2 / 100  (trend: STABLE)
- **Historical depth:** 5.7 / 100
- **Now attention:** 0.0 / 100
- **Source confidence:** 35.0 / 100
- **Profile completeness:** 55.0 / 100

## Sources
- [Seinosuke Toda](https://en.wikipedia.org/wiki/Seinosuke_Toda)
- [سينوسوكى تودا](https://arz.wikipedia.org/wiki/%D8%B3%D9%8A%D9%86%D9%88%D8%B3%D9%88%D9%83%D9%89_%D8%AA%D9%88%D8%AF%D8%A7)
- [Seinosuke Toda](https://de.wikipedia.org/wiki/Seinosuke_Toda)
- [戸田誠之助](https://ja.wikipedia.org/wiki/%E6%88%B8%E7%94%B0%E8%AA%A0%E4%B9%8B%E5%8A%A9)
- [Seinosuke Toda](https://es.wikipedia.org/wiki/Seinosuke_Toda)
- [Seinosuke Toda](https://fr.wikipedia.org/wiki/Seinosuke_Toda)
- [Wikidata](https://www.wikidata.org/wiki/Q8190500)

---
Generated by Fame.am · https://fame.am/person/seinosuke-toda