Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor · 1993
Article Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions Share on Authors: Anne Condon View Profile , Joan Feigenbaum View Profile , Carsten Lund View Profile , Peter Shor View Profile Authors Info & Claims STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of ComputingJune 1993 Pages 305–314https://doi.org/10.1145/167088.167190Online:01 June 1993Publication History 21citation326DownloadsMetricsTotal Citations21Total Downloads326Last 12 Months2Last 6 weeks0 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 SiteGet Access