ϟ
DOI: 10.1145/22145.22178
¤ OpenAccess: Green
This work has “Green” OA status. This means it may cost money to access on the publisher landing page, but there is a free copy in an OA repository.
The knowledge complexity of interactive proof-systems
Sbafi Goldwasser,Silvio Micali,Charles Rackoff
Computer science
Proof complexity
Theoretical computer science
1985
Article Free Access Share on The knowledge complexity of interactive proof-systems Authors: S Goldwasser MIT MITView Profile , S Micali MIT MITView Profile , C Rackoff University of Toronto University of TorontoView Profile Authors Info & Claims STOC '85: Proceedings of the seventeenth annual ACM symposium on Theory of computingDecember 1985Pages 291–304https://doi.org/10.1145/22145.22178Published:01 December 1985Publication History 787citation6,988DownloadsMetricsTotal Citations787Total Downloads6,988Last 12 Months2,341Last 6 weeks250 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Loading...
- MLA
- APA
- Chicago
- IEEE
- Harvard
- BibTeX
Cite this:
Generate Citation
“The knowledge complexity of interactive proof-systems” is a paper by Sbafi Goldwasser Silvio Micali Charles Rackoff published in 1985. It has an Open Access status of “green”. You can read and download a PDF Full Text of this paper here.