default search action
Seinosuke Toda
Person information
- affiliation: Nihon University, Tokyo, Japan
- award (1998): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j23]Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda:
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. Algorithmica 71(1): 120-138 (2015) - 2010
- [c16]Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda:
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. FSTTCS 2010: 327-337
2000 – 2009
- 2009
- [j22]Takayuki Nagoya, Seinosuke Toda:
Computational complexity of computing a partial solution for the Graph Automorphism problems. Theor. Comput. Sci. 410(21-23): 2064-2071 (2009) - [i2]Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda:
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. Electron. Colloquium Comput. Complex. TR09 (2009) - 2007
- [c15]Takayuki Nagoya, Seinosuke Toda:
Relating Complete and Partial Solution for Problems Similar to Graph Automorphism. MFCS 2007: 584-595 - 2006
- [j21]Seinosuke Toda:
Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are of Small Size. IEICE Trans. Inf. Syst. 89-D(8): 2388-2401 (2006) - 2005
- [j20]Ryuhei Uehara
, Seinosuke Toda, Takayuki Nagoya:
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. Discret. Appl. Math. 145(3): 479-482 (2005) - 2003
- [j19]Maciej Liskiewicz, Mitsunori Ogihara
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. Theor. Comput. Sci. 304(1-3): 129-156 (2003) - 2001
- [c14]Mitsunori Ogihara, Seinosuke Toda:
The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs. MFCS 2001: 585-597 - [i1]Mitsunori Ogihara, Seinosuke Toda:
The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs. Electron. Colloquium Comput. Complex. TR01 (2001)
1990 – 1999
- 1999
- [c13]Jun Tarui, Seinosuke Toda:
Some Observations on the Computational Complexity of Graph Accessibility Problem. COCOON 1999: 18-30 - [c12]Seinosuke Toda:
Graph Isomorphism: Its Complexity and Algorithms (Abstract). FSTTCS 1999: 341 - 1996
- [j18]Thomas Thierauf, Seinosuke Toda, Osamu Watanabe:
On Sets Bounded Truth-Table Reducible to P-Selective Sets. RAIRO Theor. Informatics Appl. 30(2): 135-154 (1996) - [j17]Mitsunori Ogihara
On Closure Properties of #P in the Context of PF ° #P. J. Comput. Syst. Sci. 53(2): 171-179 (1996) - [j16]Johannes Köbler, Seinosuke Toda:
On the Power of Generalized MOD-Classes. Math. Syst. Theory 29(1): 33-46 (1996) - 1995
- [j15]Zhi-Zhong Chen, Seinosuke Toda:
The Complexity of Selecting Maximal Solutions. Inf. Comput. 119(2): 231-239 (1995) - 1994
- [j14]Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
On Closure Properties of GapP. Comput. Complex. 4: 242-261 (1994) - [j13]Lane A. Hemaspaandra
Space-Efficient Recognition of Sparse Self-Reducible Languages. Comput. Complex. 4: 262-296 (1994) - [j12]Seinosuke Toda:
Simple Characterizations of P(#P) and Complete Problems. J. Comput. Syst. Sci. 49(1): 1-17 (1994) - [c11]Thomas Thierauf, Seinosuke Toda, Osamu Watanabe:
On Sets Bounded Truth-Table Reducible to P-selective Sets. STACS 1994: 427-438 - 1993
- [j11]Osamu Watanabe, Seinosuke Toda:
Structural Analysis of the Complexity of Inverse Functions. Math. Syst. Theory 26(2): 203-214 (1993) - [c10]Mitsunori Ogiwara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe:
On Closure Properties of #P in the Context of PF°#P. SCT 1993: 139-146 - [c9]Johannes Köbler, Seinosuke Toda:
On the Power of Generalized MOD-Classes. SCT 1993: 147-155 - [c8]Zhi-Zhong Chen, Seinosuke Toda:
The Complexity of Selecting Maximal Solutions. SCT 1993: 313-325 - 1992
- [j10]Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán:
Turing Machines with Few Accepting Computations and Low Sets for PP. J. Comput. Syst. Sci. 44(2): 272-286 (1992) - [j9]Seinosuke Toda, Mitsunori Ogiwara:
Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy. SIAM J. Comput. 21(2): 316-328 (1992) - [j8]Seinosuke Toda:
Restricted Relativizations of Probablistic Polynomial Time. Theor. Comput. Sci. 93(2): 265-277 (1992) - [j7]Seinosuke Toda, Osamu Watanabe:
Polynomial Time 1-Turing Reductions from #PH to #P. Theor. Comput. Sci. 100(1): 205-221 (1992) - [c7]Richard Beigel, Jun Tarui, Seinosuke Toda:
On Probabilistic ACC Circuits with an Exact-Threshold Output Gate. ISAAC 1992: 420-429 - 1991
- [j6]Zhi-Zhong Chen, Seinosuke Toda:
On the Complexity of Computing Optimal Solutions. Int. J. Found. Comput. Sci. 2(3): 207-220 (1991) - [j5]Seinosuke Toda:
On Polynomial-Time Truth-Table Reducibility of Intractable Sets to P-Selective Sets. Math. Syst. Theory 24(2): 68-82 (1991) - [j4]Seinosuke Toda:
PP is as Hard as the Polynomial-Time Hierarchy. SIAM J. Comput. 20(5): 865-877 (1991) - [c6]Seinosuke Toda, Mitsunori Ogiwara:
Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy. SCT 1991: 2-12 - 1990
- [j3]Seinosuke Toda:
On the Complexity of Topological Sorting. Inf. Process. Lett. 35(5): 229-233 (1990) - [j2]Seinosuke Toda:
Positive Relativizations for Log Space Computability. Theor. Comput. Sci. 77(3): 221-235 (1990) - [c5]Seinosuke Toda:
The Complexity of Finding Medians. FOCS 1990: 778-787 - [c4]Osamu Watanabe, Seinosuke Toda:
Structural Analyses on the Complexity of Inverting Functions. SIGAL International Symposium on Algorithms 1990: 31-38
1980 – 1989
- 1989
- [c3]Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán:
Turing Machines with few Accepting Computations and low Sets for PP. SCT 1989: 208-215 - [c2]Seinosuke Toda:
On the Computational Power of PP and +P. FOCS 1989: 514-519 - 1987
- [j1]Seinosuke Toda:
Sigma_2 SPACE(n) is Closed under Complement. J. Comput. Syst. Sci. 35(2): 145-152 (1987) - 1986
- [c1]Koichi Hori, Seinosuke Toda, Hisashi Yasunaga:
Learning the Space of Word Meanings for Information Retrieval Systems. COLING 1986: 374-379
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: