Problem Hardness
Problem Hardness is a quantitative measure within fitness landscape analysis that characterizes the inherent difficulty of solving an optimization problem based on the structure and distribution of local optima, modality, and navigability of the search space.
224
Publications
14.6K
Citations
480
Authors
256
Institutions
Publications per year
2017–2026
36
Variants
Problem Difficulty
Parents
224
SATzilla: Portfolio-based Algorithm Selection for SAT
Lizhong Xu, Frank Hutter, Holger H. Hoos et al. · Journal of Artificial Intelligence Research · 2008 · 835 citations · Full text
Classical hardness of learning with errors
Zvika Brakerski, Adeline Roux-Langlois, Chris Peikert et al. · 2013 · 597 citations
1–5 of 224
480
6
h-index
5
h-index
4
h-index
4
h-index
3
h-index
1–5 of 480
256
Carnegie Mellon University
Pittsburgh, United States
7 h-index
13 publications
2.1K citations

Centre National de la Recherche Scientifique
Paris, France
6 h-index
8 publications
443 citations
Colorado State University
Fort Collins, United States
6 h-index
11 publications
290 citations
Harvard University
Cambridge, United States
5 h-index
36 publications
8.4K citations

Cornell University
Ithaca, United States
5 h-index
8 publications
1.2K citations
California Institute of Technology
Pasadena, United States
5 h-index
6 publications
605 citations

University of Essex
Colchester, United Kingdom
5 h-index
8 publications
199 citations
Los Alamos National Laboratory
Los Alamos, United States
5 h-index
13 publications
1.8K citations
1–8 of 256
10 publications · 1.1K citations
10
h-index
Repository · 8 publications · 261 citations
8
h-index
7 publications · 481 citations
7
h-index
5 publications · 765 citations
5
h-index
4 publications · 106 citations
4
h-index
1–5