A note on complete sets for the polynomial-time hierarchy
Uwe Schöning · ACM SIGACT News · 1981
article Free Access Share on A note on complete sets for the polynomial-time hierarchy Author: Uwe Schöning Institut für Informatik der Universität Stuttgart, Stuttgart, Germany Institut für Informatik der Universität Stuttgart, Stuttgart, GermanyView Profile Authors Info & Claims ACM SIGACT NewsVolume 13Issue 1Winter 1981 pp 30–34https://doi.org/10.1145/1008883.1008885Published:01 January 1981Publication History 4citation196DownloadsMetricsTotal Citations4Total Downloads196Last 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