Seinosuke Toda

Publication Activity (10 Years)

Years Active: 1986-2015
Publications (10 Years): 0

Top Topics

Global Constraints

Fixed Parameter Tractable

Top Venues

Publications

Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. Algorithmica 71 (1) (2015)
Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. FSTTCS (2010)
Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. Electron. Colloquium Comput. Complex. 16 (2009)
Takayuki Nagoya, Seinosuke Toda
Computational complexity of computing a partial solution for the Graph Automorphism problems. Theor. Comput. Sci. 410 (21-23) (2009)
Takayuki Nagoya, Seinosuke Toda
Relating Complete and Partial Solution for Problems Similar to Graph Automorphism. MFCS (2007)
Seinosuke Toda
Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are of Small Size. IEICE Trans. Inf. Syst. (8) (2006)
Ryuhei Uehara, Seinosuke Toda, Takayuki Nagoya
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. Discret. Appl. Math. 145 (3) (2005)
Maciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. Theor. Comput. Sci. 304 (1-3) (2003)
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)
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. 8 (061) (2001)
Seinosuke Toda
Graph Isomorphism: Its Complexity and Algorithms (Abstract). FSTTCS (1999)
Jun Tarui, Seinosuke Toda
Some Observations on the Computational Complexity of Graph Accessibility Problem. COCOON (1999)
Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
On Sets Bounded Truth-Table Reducible to P-Selective Sets. RAIRO Theor. Informatics Appl. 30 (2) (1996)
Johannes Köbler, Seinosuke Toda
On the Power of Generalized MOD-Classes. Math. Syst. Theory 29 (1) (1996)
Mitsunori Ogihara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
On Closure Properties of #P in the Context of PF ° #P. J. Comput. Syst. Sci. 53 (2) (1996)
Zhi-Zhong Chen, Seinosuke Toda
The Complexity of Selecting Maximal Solutions Inf. Comput. 119 (2) (1995)
Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
On Sets Bounded Truth-Table Reducible to P-selective Sets. STACS (1994)
Seinosuke Toda
Simple Characterizations of P(#P) and Complete Problems. J. Comput. Syst. Sci. 49 (1) (1994)
Lane A. Hemaspaandra, Mitsunori Ogihara, Seinosuke Toda
Space-Efficient Recognition of Sparse Self-Reducible Languages. Comput. Complex. 4 (1994)
Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
On Closure Properties of GapP. Comput. Complex. 4 (1994)
Johannes Köbler, Seinosuke Toda
On the Power of Generalized MOD-Classes. Computational Complexity Conference (1993)
Osamu Watanabe, Seinosuke Toda
Structural Analysis of the Complexity of Inverse Functions. Math. Syst. Theory 26 (2) (1993)
Mitsunori Ogiwara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe
On Closure Properties of #P in the Context of PF°#P. Computational Complexity Conference (1993)
Zhi-Zhong Chen, Seinosuke Toda
The Complexity of Selecting Maximal Solutions. Computational Complexity Conference (1993)
Seinosuke Toda, Mitsunori Ogiwara
Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy. SIAM J. Comput. 21 (2) (1992)
Richard Beigel, Jun Tarui, Seinosuke Toda
On Probabilistic ACC Circuits with an Exact-Threshold Output Gate. ISAAC (1992)
Seinosuke Toda
Restricted Relativizations of Probablistic Polynomial Time. Theor. Comput. Sci. 93 (2) (1992)
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) (1992)
Seinosuke Toda, Osamu Watanabe
Polynomial Time 1-Turing Reductions from #PH to #P. Theor. Comput. Sci. 100 (1) (1992)
Seinosuke Toda
PP is as Hard as the Polynomial-Time Hierarchy. SIAM J. Comput. 20 (5) (1991)
Seinosuke Toda, Mitsunori Ogiwara
Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy. Computational Complexity Conference (1991)
Zhi-Zhong Chen, Seinosuke Toda
On the Complexity of Computing Optimal Solutions. Int. J. Found. Comput. Sci. 2 (3) (1991)
Seinosuke Toda
On Polynomial-Time Truth-Table Reducibility of Intractable Sets to P-Selective Sets. Math. Syst. Theory 24 (2) (1991)
Seinosuke Toda
Positive Relativizations for Log Space Computability. Theor. Comput. Sci. 77 (3) (1990)
Seinosuke Toda
On the Complexity of Topological Sorting. Inf. Process. Lett. 35 (5) (1990)
Seinosuke Toda
The Complexity of Finding Medians FOCS (1990)
Osamu Watanabe, Seinosuke Toda
Structural Analyses on the Complexity of Inverting Functions. SIGAL International Symposium on Algorithms (1990)
Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán
Turing Machines with few Accepting Computations and low Sets for PP. Computational Complexity Conference (1989)
Seinosuke Toda
On the Computational Power of PP and +P FOCS (1989)
Seinosuke Toda
Sigma_2 SPACE(n) is Closed under Complement. J. Comput. Syst. Sci. 35 (2) (1987)
Koichi Hori, Seinosuke Toda, Hisashi Yasunaga
Learning the Space of Word Meanings for Information Retrieval Systems. COLING (1986)