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
Showing 1 - 20 results of 51 for search 'Toda, S.', query time: 0.13s Refine Results
Search Tools: Get RSS Feed Email this Search