Truth-table Reducibility

Truth-Table Reducibility is a type of computability-theoretic reducibility in which a set \( A \) is reducible to a set \( B \) via a total computable function that, given an input \( n \), produces a finite Boolean combination of queries to \( B \) whose evaluation determines membership of \( n \) in \( A \).

64

Publications

3.8K

Citations

90

Authors

65

Institutions

Publications per year

2017–2026

1

Variants

Tt-reducibility

Publications

64

1–5 of 64

Authors

90

  1. MO
    Mitsunori Ogiwara

    University of Electro-Communications, Japan

    4 publications · 218 citations

    4

    h-index

  2. RB
    Richard Beigel

    Yale University, United States

    4 publications · 340 citations

    4

    h-index

  3. NR
    Nick Reingold

    AT&T (United States), United States

    4 publications · 332 citations

    4

    h-index

  4. LF
    Lance Fortnow

    University of Chicago, United States

    3 publications · 89 citations

    3

    h-index

  5. OW
    Osamu Watanabe

    Tokyo Institute of Technology, Japan

    3 publications · 192 citations

    3

    h-index

1–5 of 90

Venues

  1. SIAM Journal on Computing

    10 publications · 714 citations

    10

    h-index

  2. Journal of Symbolic Logic

    5 publications · 939 citations

    5

    h-index

  3. Theoretical Computer Science

    3 publications · 106 citations

    3

    h-index

  4. Transactions of the American Mathematical Society

    TRAN · 3 publications · 70 citations

    3

    h-index

  5. American Mathematical Monthly

    2 publications · 271 citations

    2

    h-index

1–5