Relativization of the Theory of Computational Complexity (Q4124321): 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)
label / enlabel / en
 
Relativization of the Theory of Computational Complexity
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/1997644 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4247851087 / rank
 
Normal rank
Property / title
 
Relativization of the Theory of Computational Complexity (English)
Property / title: Relativization of the Theory of Computational Complexity (English) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Subrecursive Hierarchy and Primitive Recursive Degrees / 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: On Effective Procedures for Speeding Up Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity and the Existence of Complexity Gaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Operator Gap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3247126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Overview of the Theory of Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly introreducible sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Helping”: several formalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Properties of Abstract Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented loop languages and classes of computable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Helping and the meet of pairs of honest subrecursive classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of computable functions defined by bounds on computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational speed-up by effective operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Classification of the Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Honest bounds for complexity classes of recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of Primitive Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Predictably Computable Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gödel numberings of partial recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Unsolvability. (AM-55) / rank
 
Normal rank

Latest revision as of 21:06, 12 June 2024

scientific article; zbMATH DE number 3550174
Language Label Description Also known as
English
Relativization of the Theory of Computational Complexity
scientific article; zbMATH DE number 3550174

    Statements

    0 references
    0 references
    0 references
    0 references
    1976
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Relativization of the Theory of Computational Complexity (English)
    0 references