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
Parents
64
William A. Howard · Journal of Symbolic Logic · 1984 · 840 citations
Klaus W. Wagner · SIAM Journal on Computing · 1990 · 294 citations
On Cores and Prime Implicants of Truth Functions
W. V. Quine · American Mathematical Monthly · 1959 · 173 citations
PP is closed under intersection
Richard Beigel, Nick Reingold, Daniel A. Spielman · 1991 · 160 citations
1–5 of 64
90
4
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 90
65
Yale University
New Haven, United States
3 h-index
5 publications
554 citations
Princeton University
Princeton, United States
3 h-index
5 publications
189 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
3 h-index
4 publications
101 citations

University of Electro-Communications
Tokyo, Japan
2 h-index
3 publications
116 citations

Harvard University Press
Cambridge, United States
2 h-index
2 publications
200 citations
University of Würzburg
Würzburg, Germany
2 h-index
3 publications
138 citations
University of Washington
Seattle, United States
2 h-index
5 publications
178 citations
Tokyo Institute of Technology
Tokyo, Japan
2 h-index
4 publications
326 citations
1–8 of 65
10 publications · 714 citations
10
h-index
5 publications · 939 citations
5
h-index
3 publications · 106 citations
3
h-index
TRAN · 3 publications · 70 citations
3
h-index
2 publications · 271 citations
2
h-index
1–5