Matching algorithmic bounds for finding a Brouwer fixed point

DOI10.1145/1379759.1379761MaRDI QIDQ3546370zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Exponential lower bounds for finding Brouwer fixed points
• Discrete fixed points: models, complexities, and applications
• Complexity of fixed point computation
• A Simplicial Approach for Discrete Fixed Point Theorems
• On the complexity of 2D discrete fixed point problem

Cited in

(14)

• Multiple-source adaptation theory and algorithms
• Two's company, three's a crowd: consensus-halving for a constant number of agents
• Unique end of potential line
• Understanding PPA-completeness
• The Brouwer fixed point theorem revisited
• scientific article; zbMATH DE number 4205881 (Why is no real title available?)
• Unique End of Potential Line
• Hardness of continuous local search: query complexity and cryptographic lower bounds
• A Faster Algorithm for Finding Tarski Fixed Points
• Computations and complexities of Tarski's fixed points and supermodular games
• Total NP search problems with abundant solutions
• Computing a fixed point of contraction maps in polynomial queries
• Computations and complexities of Tarski's fixed points and supermodular games
• Exponential lower bounds for finding Brouwer fixed points

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546370)