Random Θ(log n)-CNFs Are Hard for Cutting Planes

Article Details
Title:	Random Θ(log n)-CNFs Are Hard for Cutting Planes
Article URLs:	https://doi.org/10.1109/FOCS.2017.19 http://doi.ieeecomputersociety.org/10.1109/FOCS.2017.19
Alternative Article URLs:
Authors:	Noah Fleming	University of Toronto
	Denis Pankratov	University of Toronto
	Toniann Pitassi	University of Toronto
	Robert Robere	University of Toronto
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/focs/FlemingPPR17
Author Comments:

IEEE Foundations of Computer Science, FOCS 2017