Differences between resource bounded degree structures (Q558725): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3778006 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3905267 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Structure of Polynomial Time Reducibility / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interpretability and Definability in the Recursively Enumerable Degrees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the theory of the PTIME degrees of the recursive sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Theory of the Degrees below <b>0</b> ′ / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory / rank | |||
Normal rank |
Revision as of 12:24, 10 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Differences between resource bounded degree structures |
scientific article |
Statements
Differences between resource bounded degree structures (English)
0 references
13 July 2005
0 references
Turing degree
0 references
polynomial-time degree
0 references
truth-table degree
0 references