New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces (Q4903466): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4040055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Difference Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towers of Hanoi and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence spaces and asymmetric norms in the theory of computational complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the complexity space to the general probabilistic divide and conquer algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Denotational semantics for programming languages, balanced quasi-metrics and fixed points / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the dual complexity space and an application to computer science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-metric properties of complexity spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of the space of complexity partial functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity space of partial functions: a connection between complexity analysis and denotational semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Smyth Completion / rank
 
Normal rank

Latest revision as of 02:28, 6 July 2024

scientific article; zbMATH DE number 6127810
Language Label Description Also known as
English
New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
scientific article; zbMATH DE number 6127810

    Statements

    New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces (English)
    0 references
    22 January 2013
    0 references
    quasi-metric
    0 references
    complexity space
    0 references
    fixed point
    0 references
    improver
    0 references
    worsener
    0 references
    complexity class
    0 references
    Quicksort
    0 references
    Hanoi
    0 references
    Largetwo
    0 references

    Identifiers

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