Learn More
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)
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)
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)
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)