Computing a Fixed Point of Contraction Maps in Polynomial Queries
Journal of the ACM · 31.08.2025 · 72 (4) · 1-20
DOI: 10.1145/3744738 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of the ACM, online erschienen am 24.07.2025. Verfasst von Xi Chen und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 34 Literaturangaben. Gefördert von: NSF.
Abstract (Originalsprache)
We give an algorithm for finding an ε-fixed point of a contraction map f : [0, 1] k \(\mapsto\) [0, 1] k under the \(\ell _\infty\) -norm with query complexity O ( k log (1/ε).
Förderung
- NSF
Zitieren
APA
Chen, X., Li, Y., & Yannakakis, M. (2025). Computing a Fixed Point of Contraction Maps in Polynomial Queries. Journal of the ACM, 72(4), 1-20. https://doi.org/10.1145/3744738
Vancouver
Chen X, Li Y, Yannakakis M. Computing a Fixed Point of Contraction Maps in Polynomial Queries. Journal of the ACM. 2025;72(4):1-20. doi:10.1145/3744738
BibTeX
@article{Chen2025,
author = {Chen, Xi and Li, Yuhao and Yannakakis, Mihalis},
title = {Computing a Fixed Point of Contraction Maps in Polynomial Queries},
journal = {Journal of the ACM},
year = {2025},
volume = {72},
number = {4},
pages = {1--20},
doi = {10.1145/3744738}
}
EUVIMED