The following pages link to Strong reducibilities (Q3942949):
Displaying 35 items.
- On the complexity-relativized strong reducibilities (Q800353) (← links)
- Honest polynomial time reducibilities and the \(P=?NP\) problem (Q909455) (← links)
- Ershov hierarchy (Q1074576) (← links)
- Structural interactions of the recursively enumerable T- and W-degrees (Q1083447) (← links)
- Intervals and sublattices of the r.e. weak truth table degrees. I: Density (Q1092896) (← links)
- Classification of degree classes associated with r.e. subspaces (Q1092898) (← links)
- Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees (Q1094415) (← links)
- A note on complete problems for complexity classes (Q1097029) (← links)
- Tabular degrees in \(\alpha\)-recursion theory (Q1184713) (← links)
- Cappable recursively enumerable degrees and Post's program (Q1311427) (← links)
- Recursive versus recursively enumerable binary relations (Q1319364) (← links)
- The structure of the honest polynomial m-degrees (Q1341316) (← links)
- A problem of Odifreddi (Q1825189) (← links)
- Interpreting true arithmetic in the theory of the r.e. truth table degrees (Q1902619) (← links)
- On \(1\)-degrees inside \(m\)-degrees (Q2062067) (← links)
- Where join preservation fails in the bounded Turing degrees of c.e. sets (Q2407100) (← links)
- Lattice Embeddings in the Recursively Enumerable Truth Table Degrees (Q3030813) (← links)
- Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees (Q3317093) (← links)
- Kleene index sets and functional <i>m</i>-degrees (Q3323936) (← links)
- The index set {<i>e</i>: <i>W<sub>e</sub></i> ≡<sub>1</sub><i>X</i>}. (Q3762302) (← links)
- Recursively enumerable <i>m</i>- and tt-degrees. I: The quantity of <i>m</i>-degrees (Q3767338) (← links)
- T-Degrees, Jump Classes, and Strong Reducibilities (Q3778736) (← links)
- Two Theorems on Truth Table Degrees (Q3798648) (← links)
- Index Sets and Boolean Operations (Q3962979) (← links)
- The theory of the recursively enumerable weak truth-table degrees is undecidable (Q4032867) (← links)
- 1-reducibility inside an m-degree with a maximal set (Q4032880) (← links)
- Embedding lattices into the <i>wtt</i>-degrees below 0′ (Q4323049) (← links)
- Contiguity and distributivity in the enumerable Turing degrees (Q4382472) (← links)
- Degree theoretic definitions of the low<sub>2</sub> recursively enumerable sets (Q4858813) (← links)
- 1998–99 Annual Meeting of the Association for Symbolic Logic (Q4940738) (← links)
- Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees (Q5113922) (← links)
- Undecidability and initial segments of the (r.e.) tt-degrees (Q5202181) (← links)
- Maximal r.e. equivalence relations (Q5752560) (← links)
- Degrees of sets having no subsets of higher m- and t t-degree (Q5859845) (← links)
- Reducibility by means of almost polynomial functions (Q6132642) (← links)
