Many-one Reductions

Many-One Reduction is a formal method in computability theory that maps instances of one decision problem to instances of another such that the answer is preserved, thereby enabling the relative solvability of problems through a computable function.

31

Publications

1.3K

Citations

48

Authors

33

Institutions

Publications per year

2017–2026

2

Variants

M-reductions

Authors

48

  1. EA
    Eric Allender

    Rutgers, The State University of New Jersey, United States

    3 publications · 145 citations

    3

    h-index

  2. MK
    Michal Koucký

    Czech Academy of Sciences, Institute of Mathematics, Czechia

    2 publications · 116 citations

    2

    h-index

  3. DV
    Dieter van Melkebeek

    University of Wisconsin–Madison, United States

    2 publications · 116 citations

    2

    h-index

  4. AK
    Akitoshi Kawamura

    The University of Tokyo, Japan

    2 publications · 84 citations

    2

    h-index

  5. HB
    Harry Buhrman

    Centrum Wiskunde & Informatica, Netherlands

    2 publications · 116 citations

    2

    h-index

1–5 of 48

Venues

  1. SIAM Journal on Computing

    6 publications · 291 citations

    6

    h-index

  2. International Journal of Foundations of Computer Science

    IJFCS · 2 publications · 112 citations

    2

    h-index

  3. Journal of Computer and System Sciences

    2 publications · 331 citations

    2

    h-index

  4. eCommons (Cornell University)

    Repository · 1 publications · 19 citations

    1

    h-index

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

    Repository · 1 publications · 22 citations

    1

    h-index

1–5