About: Seinosuke Toda     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Wikicat21st-centuryMathematicians, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FSeinosuke_Toda

Seinosuke Toda (戸田 誠之助, Toda Seinosuke, born January 15, 1959) 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.

AttributesValues
rdf:type
rdfs:label
  • Seinosuke Toda (de)
  • Seinosuke Toda (es)
  • Seinosuke Toda (fr)
  • 戸田誠之助 (ja)
  • Seinosuke Toda (en)
rdfs:comment
  • Seinosuke Toda (n. en 1959, en japonés 戸田誠之助) es un informático teórico japonés que trabaja en la en Tokio, y que recibió en 1998 el Premio Gödel por haber demostrado el teorema que lleva su nombre: el Teorema de Toda. (es)
  • Seinosuke Toda (戸田 誠之助, Toda Seinosuke, né le 15 janvier 1959 ) est un chercheur japonais en informatique théorique qui travaille à l'université Nihon à Tokyo. Il a reçu en 1998 le prix Gödel pour son théorème en théorie de la complexité. (fr)
  • Seinosuke Toda (戸田 誠之助, Toda Seinosuke, born January 15, 1959) 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. (en)
  • 戸田 誠之助（とだ せいのすけ、1959年1月15日 - ）は、日本の情報工学者。日本大学文理学部情報科学科教授（2016年4月現在）。多項式階層と複雑性クラス#Pの関係 ("PP is as hard as the polynomial-time hierarchy," SIAM J. Computing 20 (1991), 865-877.) に関する研究で、極東初の1998年ゲーデル賞を受賞。 (ja)
  • Seinosuke Toda (jap. 戸田 誠之助, Toda Seinosuke; * 15. Januar 1959) ist ein japanischer Informatiker. Toda wurde 1992 bei am Tokyo Institute of Technology promoviert (Counting Classes Are at Least as Hard as the Polynomial Time Hierarchy). Er ist Professor an der Nihon-Universität. (de)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • Seinosuke Toda (jap. 戸田 誠之助, Toda Seinosuke; * 15. Januar 1959) ist ein japanischer Informatiker. Toda wurde 1992 bei am Tokyo Institute of Technology promoviert (Counting Classes Are at Least as Hard as the Polynomial Time Hierarchy). Er ist Professor an der Nihon-Universität. Toda befasst sich mit Komplexitätstheorie und Entwurf und Analyse von Algorithmen. 1998 erhielt er den Gödel-Preis für seine Arbeit PP is as Hard as the Polynomial-Time Hierarchy (SIAM Journal on Computing, Band 20, 1991, S. 865–877). Darin bewies er den Satz von Toda, dass die Polynomialzeithierarchie PH in enthalten ist. Dabei ist eine polynomzeitliche Maschine mit Sharp-P-Orakel ( wird Sharp-P ausgesprochen). Eine polynomzeitliche Maschine braucht sogar nur eine einzige Sharp-P Frage zu stellen, um alle Probleme in PH zu lösen. (de)
  • Seinosuke Toda (n. en 1959, en japonés 戸田誠之助) es un informático teórico japonés que trabaja en la en Tokio, y que recibió en 1998 el Premio Gödel por haber demostrado el teorema que lleva su nombre: el Teorema de Toda. (es)
  • Seinosuke Toda (戸田 誠之助, Toda Seinosuke, né le 15 janvier 1959 ) est un chercheur japonais en informatique théorique qui travaille à l'université Nihon à Tokyo. Il a reçu en 1998 le prix Gödel pour son théorème en théorie de la complexité. (fr)
  • Seinosuke Toda (戸田 誠之助, Toda Seinosuke, born January 15, 1959) 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. (en)
  • 戸田 誠之助（とだ せいのすけ、1959年1月15日 - ）は、日本の情報工学者。日本大学文理学部情報科学科教授（2016年4月現在）。多項式階層と複雑性クラス#Pの関係 ("PP is as hard as the polynomial-time hierarchy," SIAM J. Computing 20 (1991), 865-877.) に関する研究で、極東初の1998年ゲーデル賞を受賞。 (ja)
gold:hypernym
schema:sameAs
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 54 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software