Propositional proof complexity
Alexander Alexandrovich Razborov · Journal of the ACM · 2003
article Share on Propositional proof complexity Author: Alexander Razborov Institute for Advanced Study, Princeton, New Jersey, and Steklov Mathematical Institute, Moscow, Russia Institute for Advanced Study, Princeton, New Jersey, and Steklov Mathematical Institute, Moscow, RussiaView Profile Authors Info & Claims Journal of the ACMVolume 50Issue 1pp 80–82https://doi.org/10.1145/602382.602406Published:01 January 2003Publication History 2citation1,113DownloadsMetricsTotal Citations2Total Downloads1,113Last 12 Months7Last 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