Pages that link to "Item:Q5595155"
From MaRDI portal
The following pages link to Semirecursive Sets and Positive Reducibility (Q5595155):
Displaying 50 items.
- NP-hard sets are superterse unless NP is small (Q290182) (← links)
- Badness and jump inversion in the enumeration degrees (Q412060) (← links)
- Iterative learning from texts and counterexamples using additional information (Q415613) (← links)
- Frequency computation and bounded queries (Q671360) (← links)
- Reducibility classes of P-selective sets (Q672155) (← links)
- Some results on selectivity and self-reducibility (Q672402) (← links)
- P-selectivity: Intersections and indices (Q673115) (← links)
- A note on P-selective sets and closeness (Q673619) (← links)
- On sets Turing reducible to p-selective sets (Q675861) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- Recursive-combinatorial properties of subsets of the natural numbers (Q803118) (← links)
- Weak combinatorial selective properties of subsets of the natural numbers (Q810011) (← links)
- Strong enumeration reducibilities (Q850805) (← links)
- Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility (Q892147) (← links)
- Reducibilities among equivalence relations induced by recursively enumerable structures (Q896924) (← links)
- Property of t-retraceability and automorphisms of the lattice of recursively enumerable sets (Q912844) (← links)
- Branching in the \({\Sigma^0_2}\)-enumeration degrees: a new perspective (Q938234) (← links)
- Structural properties of \(Q\)-degrees of n-c.e. sets (Q958482) (← links)
- Goodness in the enumeration and singleton degrees (Q992037) (← links)
- Upper semilattice of recursively enumerable Q-degrees (Q1071761) (← links)
- e- and s-degrees (Q1078170) (← links)
- A class of hypersimple incomplete sets (Q1078559) (← links)
- Degrees of denumerability reducibilities (Q1095898) (← links)
- Polynomial terse sets (Q1104077) (← links)
- Nondeterministic bounded query reducibilities (Q1120564) (← links)
- Three theorems on tt-degrees (Q1140637) (← links)
- Reducibility by Zhegalkin-linear tables (Q1149947) (← links)
- tt-degrees of recursively enumerable Turing degrees. II (Q1150611) (← links)
- Some observations on NP real numbers and P-selective sets (Q1164623) (← links)
- Reductions on NP and p-selective sets (Q1166515) (← links)
- Some effects of Ash-Nerode and other decidability conditions on degree spectra (Q1182431) (← links)
- Densely simple sets with retraceable complements (Q1191171) (← links)
- The \(n\)-rea enumeration degrees are dense (Q1204114) (← links)
- Countable thin \(\Pi^0_1\) classes (Q1208080) (← links)
- Weakly semirecursive sets and r.e. orderings (Q1210140) (← links)
- btt-reducibility (Q1218850) (← links)
- tt- and m-degrees (Q1230623) (← links)
- On the congruence of the upper semilattices of recursively enumerable m- powers and tabular powers (Q1244337) (← links)
- Inductive definability in formal language theory (Q1245578) (← links)
- One class of partial sets (Q1253250) (← links)
- e-powers of hyperimmune retraceable sets (Q1258733) (← links)
- Turing degrees of certain isomorphic images of computable relations (Q1295383) (← links)
- Computably enumerable sets and quasi-reducibility (Q1295419) (← links)
- On symmetric differences of NP-hard sets with weakly P-selective sets (Q1314375) (← links)
- Quasi-linear truth-table reductions to \(p\)-selective sets (Q1351469) (← links)
- Time bounded frequency computations (Q1383147) (← links)
- Turing degrees of hypersimple relations on computable structures (Q1399102) (← links)
- Classes bounded by incomplete sets (Q1602854) (← links)
- Enumeration 1-genericity in the local enumeration degrees (Q1633891) (← links)
- Positive presentations of families in relation to reducibility with respect to enumerability (Q1731525) (← links)
