Smoothed complexity of local max-cut and binary max-CSP

DOI10.1145/3357713.3384325OpenAlexW3035284786MaRDI QIDQ5144991

Xi Chen, Emmanouil V. Vlatakis-Gkaragkounis, Chenghao Guo, Mihalis Yannakakis, Xinzhi Zhang

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.10381

zbMATH Keywords

local searchmax-cutsmoothed analysismax-CSP

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Friendly bisections of random graphs

This page was built for publication: Smoothed complexity of local max-cut and binary max-CSP