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

Authors

13

  1. RS
    Rahul Santhanam

    University of Oxford, United Kingdom

    4 publications · 85 citations

    4

    h-index

  2. IC
    Igor Carboni Oliveira

    University of Oxford, United Kingdom

    3 publications · 75 citations

    3

    h-index

  3. JP
    Ján Pich

    University of Oxford, United Kingdom

    3 publications · 49 citations

    3

    h-index

  4. LC
    Lijie Chen

    Tsinghua University, China

    3 publications · 52 citations

    3

    h-index

  5. SH
    Shuichi Hirahara

    National Institute of Informatics, Japan

    2 publications · 25 citations

    2

    h-index

1–5 of 13

Venues

  1. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 1 publications · 24 citations

    1

    h-index

  2. The Astrophysical Journal

    ApJ · 1 publications · 129 citations

    1

    h-index

  3. Warwick Research Archive Portal (University of Warwick)

    Repository · 1 publications · 15 citations

    1

    h-index

  4. DSpace@MIT (Massachusetts Institute of Technology)

    Repository · 1 publications · 19 citations

    1

    h-index

  5. Journal of the ACM

    JACM · 1 publications · 10 citations

    1

    h-index

1–5