Seinosuke Toda

Affiliations:
  • Nihon University, Tokyo, Japan


According to our database1, Seinosuke Toda authored at least 32 papers between 1986 and 2009.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2009
Computational complexity of computing a partial solution for the Graph Automorphism problems.
Theor. Comput. Sci., 2009

Colored Hypergraph Isomorphism is Fixed Parameter Tractable.
Electron. Colloquium Comput. Complex., 2009

2007
Relating Complete and Partial Solution for Problems Similar to Graph Automorphism.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006
Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are of Small Size.
IEICE Trans. Inf. Syst., 2006

2005
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs.
Discret. Appl. Math., 2005

2003
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
Theor. Comput. Sci., 2003

2001
The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs
Electron. Colloquium Comput. Complex., 2001

1999
Graph Isomorphism: Its Complexity and Algorithms (Abstract).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

Some Observations on the Computational Complexity of Graph Accessibility Problem.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1996
On the Power of Generalized MOD-Classes.
Math. Syst. Theory, 1996

On Closure Properties of #P in the Context of PF ° #P.
J. Comput. Syst. Sci., 1996

On Sets Bounded Truth-Table Reducible to P-Selective Sets.
RAIRO Theor. Informatics Appl., 1996

1995
The Complexity of Selecting Maximal Solutions
Inf. Comput., June, 1995

1994
Simple Characterizations of P(#P) and Complete Problems.
J. Comput. Syst. Sci., 1994

On Closure Properties of GapP.
Comput. Complex., 1994

Space-Efficient Recognition of Sparse Self-Reducible Languages.
Comput. Complex., 1994

1993
Structural Analysis of the Complexity of Inverse Functions.
Math. Syst. Theory, 1993

1992
Polynomial Time 1-Turing Reductions from #PH to #P.
Theor. Comput. Sci., 1992

Restricted Relativizations of Probablistic Polynomial Time.
Theor. Comput. Sci., 1992

Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy.
SIAM J. Comput., 1992

Turing Machines with Few Accepting Computations and Low Sets for PP.
J. Comput. Syst. Sci., 1992

On Probabilistic ACC Circuits with an Exact-Threshold Output Gate.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991
PP is as Hard as the Polynomial-Time Hierarchy.
SIAM J. Comput., 1991

On Polynomial-Time Truth-Table Reducibility of Intractable Sets to P-Selective Sets.
Math. Syst. Theory, 1991

On the Complexity of Computing Optimal Solutions.
Int. J. Found. Comput. Sci., 1991

1990
Positive Relativizations for Log Space Computability.
Theor. Comput. Sci., 1990

On the Complexity of Topological Sorting.
Inf. Process. Lett., 1990

Structural Analyses on the Complexity of Inverting Functions.
Proceedings of the Algorithms, 1990

The Complexity of Finding Medians
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
On the Computational Power of PP and +P
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1987
Sigma_2 SPACE(n) is Closed under Complement.
J. Comput. Syst. Sci., 1987

1986
Learning the Space of Word Meanings for Information Retrieval Systems.
Proceedings of the 11th International Conference on Computational Linguistics, 1986


  Loading...