ACM Symposium on Theory of Computing, STOC 2018


Article Details
Title: A converse to Banach's fixed point theorem and its CLS-completeness
Article URLs:
Alternative Article URLs:
Authors: Constantinos Daskalakis
  • MIT, EECS
Christos Tzamos
  • Microsoft Research
Manolis Zampetakis
  • MIT, EECS
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1551875, 1617730, 1650733
DBLP Key: conf/stoc/DaskalakisTZ18
Author Comments:

Discuss this paper and its artifacts below