On algorithms for discrete and approximate brouwer fixed points

DOI10.1145/1060590.1060638MaRDI QIDQ3581431zbMATH OpenOpenAlexFDO

Authors Xi Chen, Xiaotie Deng

Publication date 16 August 2010

Published in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General equilibrium theory (91B50)

Cited in

(13)

• A simplicial approach for discrete fixed point theorems
• On the complexity of 2D discrete fixed point problem
• Unique end of potential line
• A note on two fixed point problems
• Circumscribed ellipsoid algorithm for fixed-point problems
• Equilibria, fixed points, and complexity classes
• Unique End of Potential Line
• The randomized query complexity of finding a Tarski fixed point on the Boolean hypercube
• Computing approximate roots of monotone functions
• Tarski lower bounds from multi-dimensional herringbones
• On the quantum query complexity of local search in two and three dimensions
• Quantum separation of local search and fixed point computation
• Optimal bounds on finding fixed points of contraction mappings

Describes a project that uses

Uses Software

• BEDFix

This page was built for publication: On algorithms for discrete and approximate brouwer fixed points

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