Reductions

Reduction is a formal method in computational complexity theory that establishes the relative difficulty of computational problems by transforming instances of one problem into instances of another, thereby enabling the classification of problems into complexity classes based on their solvability.

3.9K

Publications

211.7K

Citations

14.1K

Authors

3.8K

Institutions

Publications per year

2017–2026

629

Authors

14.1K

  1. HC
    Herbert C. Brown

    Purdue University West Lafayette, United States

    55 publications · 4.1K citations

    40

    h-index

  2. KM
    Karl M. Kadish

    University of Houston, United States

    14 publications · 608 citations

    13

    h-index

  3. PV
    P. Veeraraghavan Ramachandran

    Purdue University West Lafayette, United States

    14 publications · 958 citations

    13

    h-index

  4. HS
    Harry S. Mosher

    Stanford University, United States

    15 publications · 699 citations

    13

    h-index

  5. NM
    Nung Min Yoon

    Sogang University, South Korea

    11 publications · 1.1K citations

    11

    h-index

1–5 of 14.1K

Venues

  1. Journal of the American Chemical Society

    JACS · 89 publications · 6.7K citations

    50

    h-index

  2. The Journal of Organic Chemistry

    JOC · 106 publications · 5.9K citations

    46

    h-index

  3. PubMed

    Repository · 103 publications · 3.5K citations

    33

    h-index

  4. Inorganic Chemistry

    39 publications · 1.7K citations

    26

    h-index

  5. Tetrahedron Letters

    29 publications · 1.1K citations

    22

    h-index

1–5