Seinosuke Toda - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 41 from 41

2015

Colored Hypergraph Isomorphism is Fixed Parameter TractableVikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda. algorithmica, 71(1):120-138, 2015. [doi]

2010

Colored Hypergraph Isomorphism is Fixed Parameter TractableVikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda. fsttcs 2010: 327-337 [doi]

2009

Colored Hypergraph Isomorphism is Fixed Parameter TractableVikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda. eccc, 16:93, 2009. [doi]

Computational complexity of computing a partial solution for the Graph Automorphism problemsTakayuki Nagoya, Seinosuke Toda. TCS, 410(21-23):2064-2071, 2009. [doi]

2007

Relating Complete and Partial Solution for Problems Similar to Graph AutomorphismTakayuki Nagoya, Seinosuke Toda. mfcs 2007: 584-595 [doi]

2006

Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are of Small SizeSeinosuke Toda. ieicet, 89-D(8):2388-2401, 2006. [doi]

2005

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphsRyuhei Uehara, Seinosuke Toda, Takayuki Nagoya. DAM, 145(3):479-482, 2005. [doi]

2003

The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubesMaciej Liskiewicz, Mitsunori Ogihara, Seinosuke Toda. TCS, 1-3(304):129-156, 2003. [doi]

2001

The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube GraphsMitsunori Ogihara, Seinosuke Toda. mfcs 2001: 585-597 [doi]

The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional Grid Graphs and in Hypercube GraphsMitsunori Ogihara, Seinosuke Toda. eccc, 8(061), 2001. [doi]

1999

Some Observations on the Computational Complexity of Graph Accessibility ProblemJun Tarui, Seinosuke Toda. cocoon 1999: 18-30 [doi]

Graph Isomorphism: Its Complexity and Algorithms (Abstract)Seinosuke Toda. fsttcs 1999: 341 [doi]

1996

On the Power of Generalized MOD-ClassesJohannes Köbler, Seinosuke Toda. mst, 29(1):33-46, 1996.

On Closure Properties of #P in the Context of PF ° #PMitsunori Ogihara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe. jcss, 53(2):171-179, 1996.

On Sets Bounded Truth-Table Reducible to P-Selective SetsThomas Thierauf, Seinosuke Toda, Osamu Watanabe. ita, 30(2):135-154, 1996.

1995

The Complexity of Selecting Maximal SolutionsZhi-Zhong Chen, Seinosuke Toda. iandc, 119(2):231-239, June 1995.

1994

Space-Efficient Recognition of Sparse Self-Reducible LanguagesLane A. Hemaspaandra, Mitsunori Ogihara, Seinosuke Toda. cc, 4:262-296, 1994.

On Closure Properties of GapPThomas Thierauf, Seinosuke Toda, Osamu Watanabe. cc, 4:242-261, 1994.

On Sets Bounded Truth-Table Reducible to P-selective SetsThomas Thierauf, Seinosuke Toda, Osamu Watanabe. STACS 1994: 427-438

Simple Characterizations of P(#P) and Complete ProblemsSeinosuke Toda. jcss, 49(1):1-17, 1994.

1993

The Complexity of Selecting Maximal SolutionsZhi-Zhong Chen, Seinosuke Toda. cocoon 1993: 313-325

On the Power of Generalized MOD-ClassesJohannes Köbler, Seinosuke Toda. cocoon 1993: 147-155

On Closure Properties of #P in the Context of PF°#PMitsunori Ogiwara, Thomas Thierauf, Seinosuke Toda, Osamu Watanabe. cocoon 1993: 139-146

Structural Analysis of the Complexity of Inverse FunctionsOsamu Watanabe, Seinosuke Toda. mst, 26(2):203-214, 1993.

1992

On Probabilistic ACC Circuits with an Exact-Threshold Output GateRichard Beigel, Jun Tarui, Seinosuke Toda. isaac 1992: 420-429

Turing Machines with Few Accepting Computations and Low Sets for PPJohannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán. jcss, 44(2):272-286, 1992.

Counting Classes are at Least as Hard as the Polynomial-Time HierarchySeinosuke Toda, Mitsunori Ogiwara. SICOMP, 21(2):316-328, 1992.

Polynomial Time 1-Turing Reductions from #PH to #PSeinosuke Toda, Osamu Watanabe. TCS, 100(1):205-221, 1992.

Restricted Relativizations of Probablistic Polynomial TimeSeinosuke Toda. TCS, 93(2):265-277, 1992.

1991

On the Complexity of Computing Optimal SolutionsZhi-Zhong Chen, Seinosuke Toda. ijfcs, 2(3):207-220, 1991.

On Polynomial-Time Truth-Table Reducibility of Intractable Sets to P-Selective SetsSeinosuke Toda. mst, 24(2):68-82, 1991.

Counting Classes Are at Least as Hard as the Polynomial-Time HierarchySeinosuke Toda, Mitsunori Ogiwara. cocoon 1991: 2-12

PP is as Hard as the Polynomial-Time HierarchySeinosuke Toda. SICOMP, 20(5):865-877, 1991.

1990

The Complexity of Finding MediansSeinosuke Toda. focs 1990: 778-787

On the Complexity of Topological SortingSeinosuke Toda. ipl, 35(5):229-233, 1990.

Positive Relativizations for Log Space ComputabilitySeinosuke Toda. TCS, 77(3):221-235, 1990.

Structural Analyses on the Complexity of Inverting FunctionsOsamu Watanabe, Seinosuke Toda. sigal 1990: 31-38

1989

Turing Machines with few Accepting Computations and low Sets for PPJohannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán. cocoon 1989: 208-215

On the Computational Power of PP and +PSeinosuke Toda. focs 1989: 514-519

1987

Sigma_2 SPACE(n) is Closed under ComplementSeinosuke Toda. jcss, 35(2):145-152, 1987.

1986

Learning the Space of Word Meanings for Information Retrieval SystemsKoichi Hori, Seinosuke Toda, Hisashi Yasunaga. COLING 1986: 374-379

Sign in or sign up to see more results.

runs on WebDSL