On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms (Q2331702): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s13398-019-00691-8 / 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
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
0 references
0 references
