Seinosuke Toda

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