Seinosuke Toda

According to our database, Seinosuke Toda authored at least 32 papers between 1986 and 2010.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2010

Colored Hypergraph Isomorphism is Fixed Parameter Tractable.

Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009

Computational complexity of computing a partial solution for the Graph Automorphism problems.

Takayuki Nagoya, Seinosuke Toda

Theor. Comput. Sci., 2009

2007

Relating Complete and Partial Solution for Problems Similar to Graph Automorphism.

Takayuki Nagoya, Seinosuke Toda

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are of Small Size.

Seinosuke Toda

IEICE Trans. Inf. Syst., 2006

2005

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs.

Ryuhei Uehara, Seinosuke Toda, Takayuki Nagoya

Discret. Appl. Math., 2005

2003

The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.

Maciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda

Theor. Comput. Sci., 2003

2001

The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs.

Mitsunori Ogihara, Seinosuke Toda

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

1999

Graph Isomorphism: Its Complexity and Algorithms (Abstract).

Seinosuke Toda

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

Some Observations on the Computational Complexity of Graph Accessibility Problem.

Jun Tarui, Seinosuke Toda

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1994

Simple Characterizations of P(#P) and Complete Problems.

Seinosuke Toda

J. Comput. Syst. Sci., 1994

On Closure Properties of GapP.

Thomas Thierauf, Seinosuke Toda, Osamu Watanabe

Comput. Complex., 1994

Space-Efficient Recognition of Sparse Self-Reducible Languages.

Lane A. Hemaspaandra, Mitsunori Ogihara, Seinosuke Toda

Comput. Complex., 1994

On Sets Bounded Truth-Table Reducible to P-selective Sets.

Thomas Thierauf, Seinosuke Toda, Osamu Watanabe

Proceedings of the STACS 94, 1994

1993

Structural Analysis of the Complexity of Inverse Functions.

Osamu Watanabe, Seinosuke Toda

Math. Syst. Theory, 1993

On Closure Properties of #P in the Context of PF°#P.

Mitsunori Ogiwara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe

Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

On the Power of Generalized MOD-Classes.

Johannes Köbler, Seinosuke Toda

Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

The Complexity of Selecting Maximal Solutions.

Zhi-Zhong Chen, Seinosuke Toda

Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992

Polynomial Time 1-Turing Reductions from #PH to #P.

Seinosuke Toda, Osamu Watanabe

Theor. Comput. Sci., 1992

Restricted Relativizations of Probablistic Polynomial Time.

Seinosuke Toda

Theor. Comput. Sci., 1992

On Probabilistic ACC Circuits with an Exact-Threshold Output Gate.

Richard Beigel, Jun Tarui, Seinosuke Toda

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991

PP is as Hard as the Polynomial-Time Hierarchy.

Seinosuke Toda

SIAM J. Comput., 1991

On Polynomial-Time Truth-Table Reducibility of Intractable Sets to P-Selective Sets.

Seinosuke Toda

Math. Syst. Theory, 1991

On the Complexity of Computing Optimal Solutions.

Zhi-Zhong Chen, Seinosuke Toda

Int. J. Found. Comput. Sci., 1991

Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy.

Seinosuke Toda, Mitsunori Ogiwara

Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991

1990

Positive Relativizations for Log Space Computability.

Seinosuke Toda

Theor. Comput. Sci., 1990

On the Complexity of Topological Sorting.

Seinosuke Toda

Inf. Process. Lett., 1990

Structural Analyses on the Complexity of Inverting Functions.

Osamu Watanabe, Seinosuke Toda

Proceedings of the Algorithms, 1990

The Complexity of Finding Medians

Seinosuke Toda

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

On the Computational Power of PP and +P

Seinosuke Toda

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Turing Machines with few Accepting Computations and low Sets for PP.

Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán

Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1987

Sigma_2 SPACE(n) is Closed under Complement.

Seinosuke Toda

J. Comput. Syst. Sci., 1987

1986

Learning the Space of Word Meanings for Information Retrieval Systems.

Koichi Hori, Seinosuke Toda, Hisashi Yasunaga

Proceedings of the 11th International Conference on Computational Linguistics, 1986