Hardness Magnification
Hardness Magnification is a theoretical framework in computational complexity that belongs to the class of methods analyzing the relationship between weak and strong computational models, distinguished by its principle that minor improvements in solving a problem against weak models imply major separations in complexity classes.
8
Publications
289
Citations
13
Authors
8
Institutions
Publications per year
2017–2026
7
Parents
8
Hardness Magnification for Natural Problems
Igor Carboni Oliveira, Rahul Santhanam · 2018 · 36 citations
Hardness Magnification for all Sparse NP Languages
Lijie Chen, Ce Jin, Ryan Williams · 2019 · 27 citations
1–5 of 8
13
4
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 13
8
University of Oxford
Oxford, United Kingdom
4 h-index
10 publications
209 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
4 publications
83 citations

National Institute of Informatics
Tokyo, Japan
2 h-index
2 publications
25 citations

University of Warwick
Coventry, United Kingdom
2 h-index
3 publications
35 citations
Tsinghua University
Beijing, China
1 h-index
1 publications
27 citations
IIT@MIT
Cambridge, United States
1 h-index
2 publications
54 citations
University of Vienna
Vienna, Austria
1 h-index
1 publications
15 citations
University of California, Berkeley
Berkeley, United States
1 h-index
1 publications
29 citations
1–8 of 8
Repository · 1 publications · 24 citations
1
h-index
ApJ · 1 publications · 129 citations
1
h-index
Repository · 1 publications · 15 citations
1
h-index
Repository · 1 publications · 19 citations
1
h-index
JACM · 1 publications · 10 citations
1
h-index
1–5