The Chicago Journal of Theoretical Computer Science

                      MIT Press

               1995 Table of Contents


1. Symmetric Logspace is Closed Under Complement
   by Noam Nisan and Amnon Ta-Shma
   30 June 1995

2. On the Weak mod m Representation of Boolean Functions
   by Vince Grolmusz
   21 July 1995

3. Rabin Measures
   by Nils Klarlund and Dexter Kozen
   20 September 1995

4. Probabilistically Checkable Debate Systems and Nonapproximability
   of PSPACE-Hard Functions
   by Anne Condon, Joan Feigenbaum, Carsten Lund, and Peter W. Shor
   19 October 1995