
Understanding the empirical hardness of NP -complete problems
Leyton-Brown, Kevin, Hoos, Holger H., Hutter, Frank, Xu, LinVolume:
57
Langue:
english
Journal:
Communications of the ACM
DOI:
10.1145/2594413.2594424
Date:
May, 2014
Fichier:
PDF, 2.88 MB
english, 2014