Chicago Journal of Theoretical Computer Science, 1995

Volume 1995, 1995

• Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor:
  Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions.
  Electronic Edition (link) BibTeX
• Nils Klarlund, Dexter Kozen:
  Rabin Measures.
  Electronic Edition (link) BibTeX
• Vince Grolmusz:
  On the Weak mod m Representation of Boolean Functions.
  Electronic Edition (link) BibTeX
• Noam Nisan, Amnon Ta-Shma:
  Symmetric Logspace is Closed Under Complement.
  Electronic Edition (link) BibTeX