Mod-classes are those subclasses of P #P[1] where the deterministic polynomial time
computation consists only of checking whether the oracle answer for the input lies in a certain …

… The results of section 5 thus give us an overall picture of the relations between the generalised
Mod classes as shown in Figure 1. Arrows denote containment, and connections tagged …

On the power of generalized MOD-classes … It is an open problem whether also the classes 3
Relations among … Relations among MODclasses. Theorelical Computer Science, 74:325-328…

… Nous recherchons aussi les relations entre PL, #Lt et le déterminant, sous les notions de …
That is, the relationship between the determinant and #L is even doser than the relationship …

… We obtain several relationships among these classes. (Some separations relative to an oracle
… We prove closure properties and relations among these classes. (Similar results for circuit …

… We prove closure properties and relations among these classes. (Similar results for circuit
complexity were stated without proof in [15].) In Section 9, these closure properties will permit …

We investigate the computational power of the new counting class ModP which generalizes
the classes ModpP, p prime. We show that ModP is polynomial-time truth-table equivalent in …

The classes MODkL for k 2 consist of those languages A, for which there exists a nondeterministic
Turing machine M working on logarithmically bounded space such that, for all inputs x, …

… From our circuit lower bounds, we can conswuct an oracle relative co which no containment
relations hold among MODmP classes, except for the relations listed in the preceding …

The classes MODkL for k⩾ 2 consist of those languages A, for which there exists a nondeterministic
Turing machine M working on logarithmically bounded space such that, for all inputs …