Complexity of fixed points, I

Authors:
K. Sikorski;H. Woźniakowski
Affiliations:
Univ. of Utah, Salt Lake City;Columbia Univ., New York, NY
Venue:
Journal of Complexity
Year:
1987

Citing 0
Cited 3

On algorithms for discrete and approximate brouwer fixed points

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A note on two fixed point problems

Journal of Complexity
Matching algorithmic bounds for finding a Brouwer fixed point

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract