On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms (Q2331702): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s13398-019-00691-8 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2946020682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Hausdorff Topology and Domain Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Aspects of Logic Programming Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3615515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3969890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed point theorem for non-monotonic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed points and coincidences of mappings of partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common fixed points and coincidences of mapping families on partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Smyth Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces / 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: The contraction principle as a particular case of Kleene's fixed point theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4546500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Qualitative versus quantitative fixed point techniques in computer science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cauchy sequences in quasi-pseudo-metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional Analysis in Asymmetric Normed Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Yoneda completion of a quasi-metric space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Metric Topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Difference Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S13398-019-00691-8 / rank
 
Normal rank

Latest revision as of 11:28, 28 December 2024

scientific article
Language Label Description Also known as
English
On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms
scientific article

    Statements

    On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms (English)
    0 references
    0 references
    0 references
    0 references
    30 October 2019
    0 references
    partial order
    0 references
    quasi-metric
    0 references
    fixed point
    0 references
    Kleene
    0 references
    asymptotic complexity
    0 references
    recurrence equation
    0 references

    Identifiers

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