Bounding and nonbounding minimal pairs in the enumeration degrees (Q5718686): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Enumeration Reducibility Using Bounded Information: Counting Minimal Covers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On minimal pairs of enumeration degrees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reducibility and Completeness for Sets of Integers / rank | |||
Normal rank | |||
Latest revision as of 14:18, 11 June 2024
scientific article; zbMATH DE number 2247444
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounding and nonbounding minimal pairs in the enumeration degrees |
scientific article; zbMATH DE number 2247444 |
Statements
Bounding and nonbounding minimal pairs in the enumeration degrees (English)
0 references
16 January 2006
0 references
e-degree
0 references
s-degree
0 references
minimal pair
0 references
