Computational complexity, speedable and levelable sets (Q4185801): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/2271876 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069890413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of recursively enumerable sets which have no maximal supersets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Effective Procedures for Speeding Up Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the lattice of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Properties of Abstract Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5656753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativized Halting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets which are uniform for finite extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation and embedding in the recursively enumerable degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The elementary theory of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra and halting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The class of recursively enumerable subsets of a recursively enumerabl e set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three theorems on the degrees of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dichotomy of the Recursively Enumerable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable sets of positive integers and their decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Recursively Enumerable Sets and Degrees of Unsolvability / rank
 
Normal rank

Latest revision as of 01:38, 13 June 2024

scientific article; zbMATH DE number 3622939
Language Label Description Also known as
English
Computational complexity, speedable and levelable sets
scientific article; zbMATH DE number 3622939

    Statements

    Computational complexity, speedable and levelable sets (English)
    0 references
    0 references
    1978
    0 references
    Computational Complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references