On the complexity of finding a Caristi's fixed point (Q2032159)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7360079
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of finding a Caristi's fixed point |
scientific article; zbMATH DE number 7360079 |
Statements
On the complexity of finding a Caristi's fixed point (English)
0 references
16 June 2021
0 references
computational complexity
0 references
theory of computation
0 references
PLS
0 references
Caristi's fixed point theorem
0 references
Brøndsted's fixed point theorem
0 references
0.777737021446228
0 references
0.7735216617584229
0 references
0.7576103806495667
0 references
0.7544626593589783
0 references
0.7532545924186707
0 references
