Effective category and measure in abstract complexity theory (Q672752): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/tcs/CaludeZ96, #quickstatements; #temporary_batch_1731543907597
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57001764 / 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 the size of machines / 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: Q4285775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recursive bounds for the exceptional values in speed-up / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Size of Sets of Partial Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theories of computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativized topological size of sets of partial recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: RECURSIVE BAIRE CLASSIFICATION AND SPEEDABLE FUNCTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is independence an exception? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Operator Gap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of recursive predicates of measure zero / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on A.E. h-complex functions / 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: On size vs. efficiency for programs admitting speed-ups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Category and Measure in Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost everywhere high nonuniform complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4153600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost every set in exponential time is P-bi-immune / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational speed-up by effective operators / 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: Q4187763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process complexity and effective random tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of realizable space complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4174232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4088272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: If not empty, NP-P is topologically large / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the topological size of p-m-complete degrees / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/CaludeZ96 / rank
 
Normal rank

Latest revision as of 01:29, 14 November 2024

scientific article
Language Label Description Also known as
English
Effective category and measure in abstract complexity theory
scientific article

    Statements

    Effective category and measure in abstract complexity theory (English)
    0 references
    0 references
    0 references
    28 February 1997
    0 references
    operator speed-up theorem
    0 references
    compression theorem
    0 references
    effective version of Baire category theorem
    0 references
    complexity classes of recursive predicates
    0 references
    operator gap theorem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers