External Links

    Journal: Theory Comput. Syst.

    Volume 28, Issue 3

    173 -- 198Richard Chang, Jim Kadin. On Computing Boolean Connectives of Characteristic Functions
    199 -- 213Michael A. Palis, Sunil M. Shende. Pumping Lemmas for the Control Language Hierarchy
    215 -- 228Jeff I. Chu, Georg Schnitger. Communication Complexity of Matrix Computation over Finite Fields
    229 -- 243Kenneth W. Regan, James S. Royer. On Closure Properties of Bounded Two-Sided Error Complexity Classes
    245 -- 266Emanuela Fachini, Jozef Gruska, Margherita Napoli, Domenico Parente. Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata
    267 -- 279Sanjay Jain, Arun Sharma. Prudence in Vacillatory Language Identification
    runs on