Reducibility

Reducibility is a formal relation in computability theory that classifies decision problems by determining whether one problem can be algorithmically transformed into another, thereby establishing relative solvability through the existence of a computable function mapping instances of the first problem to instances of the second.

849

Publications

38K

Citations

2.3K

Authors

837

Institutions

Publications per year

2017–2026

181

Authors

2.3K

  1. AS
    Andrzej Schinzel

    Institute of Mathematics, Poland

    7 publications · 165 citations

    7

    h-index

  2. AL
    Alan L. Selman

    University at Buffalo, State University of New York, United States

    7 publications · 759 citations

    7

    h-index

  3. MO
    Mitsunori Ogiwara

    University of Electro-Communications, Japan

    6 publications · 248 citations

    6

    h-index

  4. BM
    Benjamin Martin

    University of Canterbury, New Zealand

    5 publications · 244 citations

    5

    h-index

  5. MB
    Michael Bate

    University of Cambridge, United Kingdom

    5 publications · 244 citations

    5

    h-index

1–5 of 2.3K

Venues

  1. Journal of Symbolic Logic

    37 publications · 1.8K citations

    23

    h-index

  2. Transactions of the American Mathematical Society

    TRAN · 18 publications · 666 citations

    15

    h-index

  3. Theoretical Computer Science

    16 publications · 968 citations

    14

    h-index

  4. The Journal of Physical Chemistry C

    14 publications · 789 citations

    14

    h-index

  5. SIAM Journal on Computing

    12 publications · 733 citations

    12

    h-index

1–5