Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
Uehara, Ryuhei, Toda, Seinosuke, Nagoya, Takayuki
Published in Discrete Applied Mathematics (30.01.2005)
Published in Discrete Applied Mathematics (30.01.2005)
Get full text
Journal Article
The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes
Liśkiewicz, Maciej, Ogihara, Mitsunori, Toda, Seinosuke
Published in Theoretical computer science (28.07.2003)
Published in Theoretical computer science (28.07.2003)
Get full text
Journal Article
Space-efficient recognition of sparse self-reducible languages
Hemaspaandra, Lane A., Ogihara, Mitsunori, Toda, Seinosuke
Published in Computational complexity (01.09.1994)
Published in Computational complexity (01.09.1994)
Get full text
Journal Article
On Closure Properties of #P in the Context of PF∘#P
Ogihara, Mitsunori, Thierauf, Thomas, Toda, Seinosuke, Watanabe, Osamu
Published in Journal of computer and system sciences (01.10.1996)
Published in Journal of computer and system sciences (01.10.1996)
Get full text
Journal Article
Conference Proceeding
On closure properties of #P in the context of PF sub( degree ) #P
Ogihara, Mitsunori, Thierauf, Thomas, Toda, Seinosuke, Watanabe, Osamu
Published in Journal of computer and system sciences (01.01.1996)
Get full text
Published in Journal of computer and system sciences (01.01.1996)
Journal Article
Turing machines with few accepting computations and low sets for PP
Kobler, Johannes, Schïng, Uwe, Toda, Seinosuke, Torán, Jacobo
Published in Journal of computer and system sciences (01.04.1992)
Published in Journal of computer and system sciences (01.04.1992)
Get full text
Journal Article
On closure properties of GapP
Thierauf, Thomas, Toda, Seinosuke, Watanabe, Osamu
Published in Computational complexity (01.09.1994)
Published in Computational complexity (01.09.1994)
Get full text
Journal Article