| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda |
Colored Hypergraph Isomorphism is Fixed Parameter Tractable.  |
FSTTCS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda |
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Takayuki Nagoya, Seinosuke Toda |
Computational complexity of computing a partial solution for the Graph Automorphism problems. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Takayuki Nagoya, Seinosuke Toda |
Relating Complete and Partial Solution for Problems Similar to Graph Automorphism. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
graph auto- morphism, Computational complexity, reducibility, partial solution |
| 1 | Seinosuke Toda |
Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are of Small Size. |
IEICE Transactions |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryuhei Uehara, Seinosuke Toda, Takayuki Nagoya |
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Maciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda |
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2001 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Tarui, Seinosuke Toda |
Some Observations on the Computational Complexity of Graph Accessibility Problem. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Seinosuke Toda |
Graph Isomorphism: Its Complexity and Algorithms (Abstract). |
FSTTCS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Thierauf, Seinosuke Toda, Osamu Watanabe |
On Sets Bounded Truth-Table Reducible to P-Selective Sets. |
ITA |
1996 |
DBLP BibTeX RDF |
|
| 1 | Johannes Köbler, Seinosuke Toda |
On the Power of Generalized MOD-Classes. |
Mathematical Systems Theory |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Mitsunori Ogihara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe |
On Closure Properties of #P in the Context of PF ° #P. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhi-Zhong Chen, Seinosuke Toda |
The Complexity of Selecting Maximal Solutions |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Lane A. Hemaspaandra, Mitsunori Ogihara, Seinosuke Toda |
Space-Efficient Recognition of Sparse Self-Reducible Languages. |
Computational Complexity |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Thierauf, Seinosuke Toda, Osamu Watanabe |
On Closure Properties of GapP. |
Computational Complexity |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Seinosuke Toda |
Simple Characterizations of P(#P) and Complete Problems. |
J. Comput. Syst. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Thierauf, Seinosuke Toda, Osamu Watanabe |
On Sets Bounded Truth-Table Reducible to P-selective Sets. |
STACS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Osamu Watanabe, Seinosuke Toda |
Structural Analysis of the Complexity of Inverse Functions. |
Mathematical Systems Theory |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Zhi-Zhong Chen, Seinosuke Toda |
The Complexity of Selecting Maximal Solutions. |
Structure in Complexity Theory Conference |
1993 |
DBLP BibTeX RDF |
|
| 1 | Johannes Köbler, Seinosuke Toda |
On the Power of Generalized MOD-Classes. |
Structure in Complexity Theory Conference |
1993 |
DBLP BibTeX RDF |
|
| 1 | Seinosuke Toda |
Restricted Relativizations of Probablistic Polynomial Time. |
Theor. Comput. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Seinosuke Toda, Osamu Watanabe |
Polynomial Time 1-Turing Reductions from #PH to #P. |
Theor. Comput. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Seinosuke Toda, Mitsunori Ogiwara |
Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy. |
SIAM J. Comput. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Beigel, Jun Tarui, Seinosuke Toda |
On Probabilistic ACC Circuits with an Exact-Threshold Output Gate. |
ISAAC |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhi-Zhong Chen, Seinosuke Toda |
On the Complexity of Computing Optimal Solutions. |
Int. J. Found. Comput. Sci. |
1991 |
DBLP BibTeX RDF |
|
| 1 | Seinosuke Toda |
On Polynomial-Time Truth-Table Reducibility of Intractable Sets to P-Selective Sets. |
Mathematical Systems Theory |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Seinosuke Toda |
PP is as Hard as the Polynomial-Time Hierarchy. |
SIAM J. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Seinosuke Toda, Mitsunori Ogiwara |
Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy. |
Structure in Complexity Theory Conference |
1991 |
DBLP BibTeX RDF |
|
| 1 | Seinosuke Toda |
On the Complexity of Topological Sorting. |
Inf. Process. Lett. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Seinosuke Toda |
Positive Relativizations for Log Space Computability. |
Theor. Comput. Sci. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Osamu Watanabe, Seinosuke Toda |
Structural Analyses on the Complexity of Inverting Functions. |
SIGAL International Symposium on Algorithms |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Seinosuke Toda |
The Complexity of Finding Medians |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
1-Turing reducible, finding medians, PF(Hash P), metric Turing machines, complexity, MidP |
| 1 | Seinosuke Toda |
On the Computational Power of PP and +P |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
two-sided bounded error probability, probabilistic Turing machine, (+)P, randomized polynomial-time reducibility, complexity classes, polynomial-time hierarchy, PH, PP |
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Seinosuke Toda |
Sigma_2 SPACE(n) is Closed under Complement. |
J. Comput. Syst. Sci. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Koichi Hori, Seinosuke Toda, Hisashi Yasunaga |
Learning the Space of Word Meanings for Information Retrieval Systems. |
COLING |
1986 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")