Tome 27 (1993) no. 4

Sommaire

On the positive and the inversion complexity of Boolean functions
p. 283-293
Space-efficient parallel merging
p. 295-310
An economical transformation of graph grammars
p. 311-325
On the restricted equivalence for subclasses of propositional logic
p. 327-340
An algorithm to compute the möbius function of the rotation lattice of binary trees
p. 341-348
Sublogarithmic ∑ 2 -space is not closed under complement and other separation results
p. 349-366
Performance considerations on a random graph model for parallel processing
p. 367-388