Modular coloring formulas are hard for cutting planes proofs

Abstract

Article Free Access Share on Modular coloring formulas are hard for cutting planes proofs Author: Xudong Fu Department of Computer Science, University of Toronto, Toronto, Ontario, Canada M5S 3G4 Department of Computer Science, University of Toronto, Toronto, Ontario, Canada M5S 3G4Search about this author Authors Info & Claims STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of ComputingJuly 1996Pages 595–602https://doi.org/10.1145/237814.238008Published:01 July 1996Publication History 1citation234DownloadsMetricsTotal Citations1Total Downloads234Last 12 Months6Last 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 SiteeReaderPDF