"Understanding the empirical hardness of NP-complete problems."

Kevin Leyton-Brown et al. (2014)

> Home

Details and statistics

DOI: 10.1145/2594413.2594424

access: closed

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cacm/Leyton-BrownHHX14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cacm/Leyton-BrownHHX14
Kevin Leyton-Brown, Holger H. Hoos, Frank Hutter, Lin Xu:
Understanding the empirical hardness of NP-complete problems. Commun. ACM 57(5): 98-107 (2014)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.