Approximation Hardness

Approximation Hardness is a theoretical measure in computational complexity that belongs to the class of properties characterizing the limits of approximation algorithms, specifically defined by the inherent difficulty of achieving better approximation ratios for optimization problems under standard complexity-theoretic assumptions.

663

Publications

51K

Citations

984

Authors

430

Institutions

Publications per year

2017–2026

75

Authors

984

  1. UF
    Uriel Feige

    Weizmann Institute of Science, Israel

    16 publications · 5K citations

    14

    h-index

  2. SK
    Subhash Khot

    Georgia Institute of Technology, United States

    14 publications · 1.5K citations

    13

    h-index

  3. SA
    Sanjeev Arora

    Princeton University, United States

    14 publications · 2.1K citations

    13

    h-index

  4. PR
    Prasad Raghavendra

    University of California, Berkeley, United States

    14 publications · 1.2K citations

    12

    h-index

  5. JH
    Johan Håstad

    KTH Royal Institute of Technology, Sweden

    15 publications · 924 citations

    12

    h-index

1–5 of 984

Venues

  1. SIAM Journal on Computing

    32 publications · 3.3K citations

    23

    h-index

  2. Journal of Approximation Theory

    26 publications · 1K citations

    17

    h-index

  3. Mathematical Programming

    16 publications · 933 citations

    15

    h-index

  4. arXiv (Cornell University)

    Repository · 29 publications · 610 citations

    15

    h-index

  5. Theoretical Computer Science

    17 publications · 1.4K citations

    15

    h-index

1–5