On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms (Q2331702)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms |
scientific article; zbMATH DE number 7124367
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms |
scientific article; zbMATH DE number 7124367 |
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
