scientific article; zbMATH DE number 4205881
From MaRDI portal
Publication:3355153
zbMATH Open0729.65037MaRDI QIDQ3355153FDOQ3355153
Authors:
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
complexitytopological degreefast algorithmscontractive functionscomputation of fixed pointsnearly optimal algorithms
Cited In (24)
- Complexity of fixed point computation
- Fast approximate PCPs
- Is There a Curse of Dimensionality for Contraction Fixed Points in the Worst Case?
- A general method to speed up fixed-parameter-tractable algorithms
- Approximating fixed points of weakly contracting mappings
- IMPROVING THE COMPUTATIONAL EFFICIENCY OF FIXED POINT ALGORITHMS
- Algorithms for the fixed point property
- Algorithm 848
- Performance guarantees and applications for Xia's algorithm
- Fast Algorithms for Pseudoarboricity
- Exponential lower bounds for finding Brouwer fixed points
- Algorithm 825
- Title not available (Why is that?)
- Complexity of fixed points. I
- Fast Algorithms for Nonsmooth Compact Fixed-Point Problems
- Circumscribed ellipsoid algorithm for fixed-point problems
- Title not available (Why is that?)
- Computational complexity of fixed points
- FAST—Fast Algorithm for the Scenario Technique
- A Fast Algorithm to Solve the Bitsadze Equation in the Unit Disk
- Fast algorithms for weighted myriad computation by fixed-point search
- Numerical reckoning fixed points via new faster iteration process
- Title not available (Why is that?)
- Faster exact algorithms for hard problems: A parameterized point of view
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3355153)
