How reductions to sparse sets collapse the polynomial-time hierarchy: a primer; part I
Paul R. Young · ACM SIGACT News · 1992
article Free Access Share on How reductions to sparse sets collapse the polynomial-time hierarchy: a primer; part I: polynomial-time Turing reductions Author: Paul Young View Profile Authors Info & Claims ACM SIGACT NewsVolume 23Issue 3Summer 1992 pp 107–117https://doi.org/10.1145/141914.141921Published:30 June 1992Publication History 12citation135DownloadsMetricsTotal Citations12Total Downloads135Last 12 Months14Last 6 weeks2 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