#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1961

2009

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

#### Method

Learn More

- Seinosuke Toda
- SIAM J. Comput.
- 1991

In this paper, two interesting complexity classes, PP and P, are compared with PH, the polynomial-time hierarchy. It is shown that every set in PH is polynomial-time Turing reducible to a set in PP, and PH is included in BP. 0)P. As a consequence of the results, it follows that PP PH (or 03P___ PH) implies a collapse of PH. A stronger result is also shown:… (More)

- M H Bornstein, C S Tamis-LeMonda, +6 authors D Vardi
- Child development
- 1992

This study examines and compares prominent characteristics of maternal responsiveness to infant activity during home-based naturalistic interactions of mother-infant dyads in New York City, Paris, and Tokyo. Both culture-general and culture-specific patterns of responsiveness emerged. For example, in all 3 locales infants behaved similarly, mothers also… (More)

- Zhi-Zhong Chen, Seinosuke Toda
- Structure in Complexity Theory Conference
- 1993

- Seinosuke Toda, Osamu Watanabe
- Theor. Comput. Sci.
- 1992

- Seinosuke Toda
- FOCS
- 1989

- Seinosuke Toda, Mitsunori Ogihara
- SIAM J. Comput.
- 1991

- Seinosuke Toda
- 1991

The main purpose of this paper is to exhibit non-algebraic problems that are computationally equivalent to computing the integer determinant. For this purpose, some graph-theoretic counting problems are shown to be equivalent to the integer determinant problem under suitable reducibilities. Those are the problems of counting the number of all paths between… (More)

- Ryuhei Uehara, Seinosuke Toda, Takayuki Nagoya
- Discrete Applied Mathematics
- 2005

This paper deals with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chordal graphs. It is known that GI problem is GI complete even for some special graph classes including regular graphs, bipar-tite graphs, chordal graphs, comparability graphs, split graphs, and k-trees with unbounded k. On the other side,… (More)

- Johannes Köbler, Seinosuke Toda
- Structure in Complexity Theory Conference
- 1993

We i n vestigate the computational power of the new counting class ModP which generalizes the classes Mod p P, p prime. We show that ModP is polynomial-time truth-table equivalent i n p o wer to #P and that ModP i s contained in the class AmpMP. As a consequence, the classes PP, ModP a n d AmpMP are all Turing equivalent, and thus AmpMP and ModP are not low… (More)

- Seinosuke Toda
- FOCS
- 1990