C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Improving the smoothed complexity of FLIP for max cut problems.
Ali Bibak
Charles Carlson
Karthekeyan Chandrasekaran
Published in:
SODA (2019)
Keyphrases
</>
max cut
np complete problems
optimization problems
computational complexity
worst case
np complete
decision problems