Key points are not available for this paper at this time.
Article Free Access Share on Efficient probabilistically checkable proofs and applications to approximations Authors: M. Bellare View Profile , S. Goldwasser View Profile , C. Lund View Profile , A. Russell View Profile Authors Info & Claims STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of ComputingJune 1993 Pages 294–304https://doi.org/10.1145/167088.167174Published:01 June 1993Publication History 182citation659DownloadsMetricsTotal Citations182Total Downloads659Last 12 Months70Last 6 weeks11 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
Bellare et al. (Fri,) studied this question.