- Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor:
Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions.
- Nils Klarlund, Dexter Kozen:
- Vince Grolmusz:
On the Weak mod m Representation of Boolean Functions.
- Noam Nisan, Amnon Ta-Shma:
Symmetric Logspace is Closed Under Complement.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.