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.
Nils Klarlund
,
Dexter Kozen
:
Rabin Measures.
Vince Grolmusz
:
On the Weak mod
m
Representation of Boolean Functions.
Noam Nisan
,
Amnon Ta-Shma
:
Symmetric Logspace is Closed Under Complement.
Last update Fri May 24 20:05:51 2013 CET by the
DBLP Team
—
Data released under the
ODC-BY 1.0 license
— See also our
legal information page