Computing a Fixed Point of Contraction Maps in Polynomial Queries

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/ε).

Authors

Institutions

Publication Details

Journal
Journal of the ACM
Published
2025-06-17
DOI
https://doi.org/10.1145/3744738
Primary Topic
Data Management and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Computing a Fixed Point of Contraction Maps in Polynomial Queries

Mihalis Yannakakis, Xi Chen, Yuhao Li
Journal of the ACM
Data Management and Algorithms
article

Computing a Fixed Point of Contraction Maps in Polynomial Queries

Mihalis Yannakakis, Xi Chen, Yuhao Li
article en

Abstract

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/ε).

Journal of the ACMVol. 72(4)
Columbia University (US)
Openalex Percentile: Top 84%
Data Management and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Computing a Fixed Point of Contraction Maps in Polynomial Queries — Mihalis Yannakakis, Xi Chen, et al. · Journal of the ACM (2025) | TGRS Research Map | TGRS