Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. The complexity of constrained min-max optimization

The complexity of constrained min-max optimization

Thumbnail Image
Download
Name

3406325.3451125.pdf

Description
Published version
Size

1.45 MB

Format

Adobe PDF

Checksum (MD5)

adccaf1d2de1204e0ab7b7f8d9911731

sword-2022-06-17T16:20:40.original.xml (130 B)
Original SWORD entry document
Author(s)
Daskalakis, Constantinos
•
Skoulakis, Stratis
•
Zampetakis, Manolis
Date Issued
2021
Journal
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
Publisher
Association for Computing Machinery (ACM)
Citation
Daskalakis, Constantinos, Skoulakis, Stratis and Zampetakis, Manolis. 2021. "The complexity of constrained min-max optimization." Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing.
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/143467
DOI of Published Version
https://doi.org/10.1145/3406325.3451125
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.