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. Provided by Wikipedia
1
2
3
4
5
6
7
8
9
10
by Masanori J. Toda, Hans Banziger, Pradeep C. Sati, Rajendra S. Fartyal, Awit Suwito, Toru Katoh
Published 2020
Get full textPublished 2020
Get full text
Journal
11
12
13
14
15
by Imaizumi, Yuki, Nagao, Norio, Md Yusoff, Fatimah, Kurosawa, Norio, Kawasaki, Nobuyuki, Toda, Tatsuki
Published 2016
Get full textPublished 2016
Get full text
Get full text
Article
17
18
19
20