Local max-cut in smoothed polynomial time

Article Details
Title:	Local max-cut in smoothed polynomial time
Article URLs:	https://doi.org/10.1145/3055399.3055402
Alternative Article URLs:
Authors:	Omer Angel	University of British Columbia, Department of Mathematics
	Sébastien Bubeck	Microsoft Research - USA
	Yuval Peres	Microsoft Research - USA
	Fan Wei	Stanford University, Department of Mathematics
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/stoc/AngelBPW17
Author Comments:

ACM Symposium on Theory of Computing, STOC 2017