The Complexity of Constrained Min-Max Optimization (Conference Paper) | NSF PAGES

skip to main content

Citation Details

The Complexity of Constrained Min-Max Optimization

Award ID(s):: 1901292

NSF-PAR ID:: 10279758

Author(s) / Creator(s):: Daskalakis, Constantinos; Skoulakis, Stratis; Zampetakis, Manolis

Date Published:: 2021-01-01

Journal Name:: the 53rd ACM Symposium on Theory of Computing (STOC)

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
The DOI is not currently available.