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-
21
-
22
-
23
-
24
-
25
-
26
-
27
-
28
-
29
-
30
-
31by Takahashi, Kunio T., Kawaguchi, So, Kobayashi, Masaki, Toda, TatsukiGet access
Published in Polar Biology (2003)
Get access
Get access
Article in Journal/Newspaper -
32by Toda, S., Miyamachi, H., Matsushima, T., Kanao, M., Fukuda, Y.Get access
Published in Gondwana Research (2001)
Get access
Get access
Article in Journal/Newspaper -
33
-
34
-
35
-
36by Toda, Ryoji, Lindsay, Dhugal, Fuentes, Veronica, Moteki, MasatoGet access
Published in Polar Biology (2014)
Get access
Article in Journal/Newspaper -
37
-
38
-
39
-
40