Login / Signup

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

Xi ChenChenghao GuoEmmanouil-Vasileios Vlatakis-GkaragkounisMihalis YannakakisXinzhi Zhang
Published in: STOC (2020)
Keyphrases
  • max csp
  • max cut
  • computational complexity
  • worst case
  • graph model
  • graph partitioning
  • min max
  • optimisation problems
  • probabilistic model
  • planar graphs