scientific article; zbMATH DE number 4205881
From MaRDI portal
Publication:3355153
Recommendations
Cited in
(24)- Faster exact algorithms for hard problems: A parameterized point of view
- Complexity of fixed point computation
- Fast approximate PCPs
- A general method to speed up fixed-parameter-tractable algorithms
- Is There a Curse of Dimensionality for Contraction Fixed Points in the Worst Case?
- Approximating fixed points of weakly contracting mappings
- Algorithms for the fixed point property
- IMPROVING THE COMPUTATIONAL EFFICIENCY OF FIXED POINT ALGORITHMS
- Algorithm 848
- Performance guarantees and applications for Xia's algorithm
- Exponential lower bounds for finding Brouwer fixed points
- Fast Algorithms for Pseudoarboricity
- Algorithm 825
- Complexity of fixed points. I
- scientific article; zbMATH DE number 927048 (Why is no real title available?)
- Fast Algorithms for Nonsmooth Compact Fixed-Point Problems
- Circumscribed ellipsoid algorithm for fixed-point problems
- Computational complexity of fixed points
- scientific article; zbMATH DE number 1929930 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 741008 (Why is no real title available?)
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)
