Complexity of fixed point computation
From MaRDI portal
Recommendations
Cited in
(18)- Complexity of fixed points. I
- Condition-sensitive computation of approximate fixed points
- Computational complexity of fixed points and intersection points
- On the complexity of finding a Caristi's fixed point
- Computational complexity of fixed points
- A note on two fixed point problems
- Search for the fixed point of a discrete monotonically decreasing operator
- scientific article; zbMATH DE number 4013878 (Why is no real title available?)
- Complexity estimates depending on condition and round-off error
- scientific article; zbMATH DE number 4205881 (Why is no real title available?)
- Matching algorithmic bounds for finding a Brouwer fixed point
- On the Complexity of 2D Discrete Fixed Point Problem
- scientific article; zbMATH DE number 18674 (Why is no real title available?)
- scientific article; zbMATH DE number 741008 (Why is no real title available?)
- Is There a Curse of Dimensionality for Contraction Fixed Points in the Worst Case?
- The limits of fixed-order computation
- Exponential lower bounds for finding Brouwer fixed points
- The complexity of Tarski's fixed point theorem
This page was built for publication: Complexity of fixed point computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4623274)
