The polynomial hierarchy and fragments of bounded arithmetic
Sam Buss · 1985
Article Free Access Share on The polynomial hierarchy and fragments of bounded arithmetic Author: S R Buss Department of Mathematics, Princeton University Department of Mathematics, Princeton UniversityView Profile Authors Info & Claims STOC '85: Proceedings of the seventeenth annual ACM symposium on Theory of computingDecember 1985 Pages 285–290https://doi.org/10.1145/22145.22177Online:01 December 1985Publication History 4citation219DownloadsMetricsTotal Citations4Total Downloads219Last 12 Months6Last 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