 | 2009 |
|---|
| 38 |       | 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) |
| 2007 |
|---|
| 37 | | Takayuki Nagoya,
Seinosuke Toda:
Relating Complete and Partial Solution for Problems Similar to Graph Automorphism.
MFCS 2007: 584-595 |
| 2006 |
|---|
| 36 | | Seinosuke Toda:
Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are of Small Size.
IEICE Transactions 89-D(8): 2388-2401 (2006) |
| 2005 |
|---|
| 35 | | Ryuhei Uehara,
Seinosuke Toda,
Takayuki Nagoya:
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs.
Discrete Applied Mathematics 145(3): 479-482 (2005) |
| 2003 |
|---|
| 34 | | Maciej Liskiewicz,
Mitsunori Ogihara,
Seinosuke Toda:
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
Theor. Comput. Sci. 1-3(304): 129-156 (2003) |
| 2001 |
|---|
| 33 | | 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 |
| 32 | | Mitsunori Ogihara,
Seinosuke Toda:
The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube Graphs
Electronic Colloquium on Computational Complexity (ECCC) 8(061): (2001) |
| 1999 |
|---|
| 31 | | Jun Tarui,
Seinosuke Toda:
Some Observations on the Computational Complexity of Graph Accessibility Problem.
COCOON 1999: 18-30 |
| 30 | | Seinosuke Toda:
Graph Isomorphism: Its Complexity and Algorithms (Abstract).
FSTTCS 1999: 341 |
| 1996 |
|---|
| 29 |  | Thomas Thierauf,
Seinosuke Toda,
Osamu Watanabe:
On Sets Bounded Truth-Table Reducible to P-Selective Sets.
ITA 30(2): 135-154 (1996) |
| 28 | | 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): 171-179 (1996) |
| 27 | | Johannes Köbler,
Seinosuke Toda:
On the Power of Generalized MOD-Classes.
Mathematical Systems Theory 29(1): 33-46 (1996) |
| 1995 |
|---|
| 26 | | Zhi-Zhong Chen,
Seinosuke Toda:
The Complexity of Selecting Maximal Solutions
Inf. Comput. 119(2): 231-239 (1995) |
| 1994 |
|---|
| 25 | | Thomas Thierauf,
Seinosuke Toda,
Osamu Watanabe:
On Sets Bounded Truth-Table Reducible to P-selective Sets.
STACS 1994: 427-438 |
| 24 | | Thomas Thierauf,
Seinosuke Toda,
Osamu Watanabe:
On Closure Properties of GapP.
Computational Complexity 4: 242-261 (1994) |
| 23 | | Lane A. Hemaspaandra,
Mitsunori Ogihara,
Seinosuke Toda:
Space-Efficient Recognition of Sparse Self-Reducible Languages.
Computational Complexity 4: 262-296 (1994) |
| 22 | | Seinosuke Toda:
Simple Characterizations of P(#P) and Complete Problems.
J. Comput. Syst. Sci. 49(1): 1-17 (1994) |
| 1993 |
|---|
| 21 | | Mitsunori Ogiwara,
Thomas Thierauf,
Seinosuke Toda,
Osamu Watanabe:
On Closure Properties of #P in the Context of PF°#P.
Structure in Complexity Theory Conference 1993: 139-146 |
| 20 | | Johannes Köbler,
Seinosuke Toda:
On the Power of Generalized MOD-Classes.
Structure in Complexity Theory Conference 1993: 147-155 |
| 19 | | Zhi-Zhong Chen,
Seinosuke Toda:
The Complexity of Selecting Maximal Solutions.
Structure in Complexity Theory Conference 1993: 313-325 |
| 18 | | Osamu Watanabe,
Seinosuke Toda:
Structural Analysis of the Complexity of Inverse Functions.
Mathematical Systems Theory 26(2): 203-214 (1993) |
| 1992 |
|---|
| 17 | | Richard Beigel,
Jun Tarui,
Seinosuke Toda:
On Probabilistic ACC Circuits with an Exact-Threshold Output Gate.
ISAAC 1992: 420-429 |
| 16 | | 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) |
| 15 | | Seinosuke Toda,
Mitsunori Ogiwara:
Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy.
SIAM J. Comput. 21(2): 316-328 (1992) |
| 14 | | Seinosuke Toda,
Osamu Watanabe:
Polynomial Time 1-Turing Reductions from #PH to #P.
Theor. Comput. Sci. 100(1): 205-221 (1992) |
| 13 | | Seinosuke Toda:
Restricted Relativizations of Probablistic Polynomial Time.
Theor. Comput. Sci. 93(2): 265-277 (1992) |
| 1991 |
|---|
| 12 | | Seinosuke Toda,
Mitsunori Ogiwara:
Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy.
Structure in Complexity Theory Conference 1991: 2-12 |
| 11 | | Zhi-Zhong Chen,
Seinosuke Toda:
On the Complexity of Computing Optimal Solutions.
Int. J. Found. Comput. Sci. 2(3): 207-220 (1991) |
| 10 | | Seinosuke Toda:
On Polynomial-Time Truth-Table Reducibility of Intractable Sets to P-Selective Sets.
Mathematical Systems Theory 24(2): 68-82 (1991) |
| 9 | | Seinosuke Toda:
PP is as Hard as the Polynomial-Time Hierarchy.
SIAM J. Comput. 20(5): 865-877 (1991) |
| 1990 |
|---|
| 8 | | Seinosuke Toda:
The Complexity of Finding Medians
FOCS 1990: 778-787 |
| 7 | | Osamu Watanabe,
Seinosuke Toda:
Structural Analyses on the Complexity of Inverting Functions.
SIGAL International Symposium on Algorithms 1990: 31-38 |
| 6 | | Seinosuke Toda:
On the Complexity of Topological Sorting.
Inf. Process. Lett. 35(5): 229-233 (1990) |
| 5 | | Seinosuke Toda:
Positive Relativizations for Log Space Computability.
Theor. Comput. Sci. 77(3): 221-235 (1990) |
| 1989 |
|---|
| 4 | | Seinosuke Toda:
On the Computational Power of PP and +P
FOCS 1989: 514-519 |
| 3 | | Johannes Köbler,
Uwe Schöning,
Seinosuke Toda,
Jacobo Torán:
Turing Machines with few Accepting Computations and low Sets for PP.
Structure in Complexity Theory Conference 1989: 208-215 |
| 1987 |
|---|
| 2 | | Seinosuke Toda:
Sigma_2 SPACE(n) is Closed under Complement.
J. Comput. Syst. Sci. 35(2): 145-152 (1987) |
| 1986 |
|---|
| 1 | | Koichi Hori,
Seinosuke Toda,
Hisashi Yasunaga:
Learning the Space of Word Meanings for Information Retrieval Systems.
COLING 1986: 374-379 |
