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 53 for search 'Toda, S.', query time: 0.04s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
    Published 2015
    Other Authors: ...Takeda Toda, Naoko...
    Get full text
    Tesis de maestría
  19. 19
  20. 20
    Published 2015
    Other Authors: ...Naoko, Takeda Toda...
    Get full text
    Tesis de maestría