Understanding the empirical hardness of-complete problems

Kevin Leyton-Brown, Holger H. Hoos, Frank Hutter, Lin XuCommunications of the ACM 2014 · OpenReview

Abstract

Using machine learning to predict algorithm runtime.
BibTeX
@article{leytonbrown2014understanding,
  author = {Kevin Leyton-Brown and Holger H. Hoos and Frank Hutter and Lin Xu},
  title = {{Understanding the empirical hardness of-complete problems}},
  journal = {Communications of the ACM},
  year = {2014},
  url = {https://openreview.net/forum?id=5HVMApEAsh},
}

Loading related content...

Figure