SIGN IN
SIGN UP
IP = PSPACE
Full Text:
PDF
Buy this Article
Author:
Adi Shamir
The Weizmann Institute of Science, Rehovot, Israel
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 39 Issue 4, Oct. 1992
Pages 869-877
ACM
New York, NY
, USA
table of contents
doi>
10.1145/146585.146609
1992 Article
Bibliometrics
· Downloads (6 Weeks): 15
· Downloads (12 Months): 144
· Downloads (cumulative): 2,222
· Citation Count: 121
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
bounded-action devices
complexity hierarchies
interactive and reactive computation
interactive and reactive computation
interactive proofs
ip
probabilistic computation
pspace
relations among complexity classes
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder