On algorithms for discrete and approximate brouwer fixed points
From MaRDI portal
Publication:3581431
DOI10.1145/1060590.1060638zbMath1192.68351MaRDI QIDQ3581431
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
Related Items
Unique End of Potential Line, Equilibria, fixed points, and complexity classes, 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, 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
Uses Software