On transformation of interactive proofs that preserve the prover's complexity
Salil Vadhan · 2000
Article Free Access Share on On transformation of interactive proofs that preserve the prover's complexity Author: Salil Vadhan MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, MA MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, MAView Profile Authors Info & Claims STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computingMay 2000 Pages 200–207https://doi.org/10.1145/335305.335330Published:01 May 2000Publication History 5citation358DownloadsMetricsTotal Citations5Total Downloads358Last 12 Months16Last 6 weeks1 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