Paper
A Quasipolynomial Algorithm for ℓ∞ Contractions
A theoretical computer science paper that presents an algorithm for computing an ε-approximate fixed point of a nonexpansive map under the ℓ∞ norm in quasipolynomial time, and derives a quasipolynomial-time algorithm for solving simple stochastic games.
Timeline (last 90 days)
Oct 22
The paper "A Quasipolynomial Algorithm for ℓ∞ Contractions" proposes an algorithm that can compute an ε-approximate fixed point of any non-expansive map under the d-dimensional ℓ∞ norm in quasipolynomial time.
Unverified50%