Matching algorithmic bounds for finding a Brouwer fixed point

DOI10.1145/1379759.1379761zbMath1311.54038OpenAlexW1987197432MaRDI QIDQ3546370

Xi Chen, Xiaotie Deng

Publication date: 21 December 2008

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1379759.1379761

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Fixed-point and coincidence theorems (topological aspects) (54H25)

Related Items (6)

Unique end of potential line ⋮ Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds ⋮ Understanding PPA-completeness ⋮ Multiple-source adaptation theory and algorithms ⋮ Unique End of Potential Line ⋮ Two's company, three's a crowd: consensus-halving for a constant number of agents

This page was built for publication: Matching algorithmic bounds for finding a Brouwer fixed point