On the complexity of unsatisfiability proofs for random k-CNF formulas
Paul W. Beame, Richard M. Karp, Toniann Pitassi, Michael Saks · 1998
Article Free Access Share on On the complexity of unsatisfiability proofs for random k-CNF formulas Authors: Paul Beame Computer Science, and Engineering, University of Washington, Box 352350, Seattle, WA Computer Science, and Engineering, University of Washington, Box 352350, Seattle, WAView Profile , Richard Karp Computer Science and Engineering, University of Washington Box, 352350, Seattle, WA Computer Science and Engineering, University of Washington Box, 352350, Seattle, WAView Profile , Toniann Pitassi Computer Science Department, University of Arizona, Tucson, AZ Computer Science Department, University of Arizona, Tucson, AZView Profile , Michael Saks Department of Mathematics, Rutgers University, New Brunswick, NJ Department of Mathematics, Rutgers University, New Brunswick, NJView Profile Authors Info & Claims STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computingMay 1998 Pages 561–571https://doi.org/10.1145/276698.276870Online:23 May 1998Publication History 47citation495DownloadsMetricsTotal Citations47Total Downloads495Last 12 Months24Last 6 weeks3 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