The complexity of constrained min-max optimization

Saved in:
Bibliographic Details
Published inProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
Format Conference Proceeding
LanguageEnglish
Published 15.06.2021
Online AccessGet full text
DOI10.1145/3406325.3451125

Cover

BookMark eNotzzFvwjAUBGAPdADamTV_INTPz07EiFAplZC60Nl6TmxhKbajYFTCr4eqmU53w0nfgs1iipaxFfA1gFTvKHmFQq1RKgCh5kyczrZoUug7e_N5LJJ7tnjJA_lo2yL4WAa6FanPPvg7ZZ_iK3tx1F3s25RL9rP_OO0O5fH782u3PZaEKHPZIiBJp2pZEzpCa2pHYFTVVGgAUUkuSEArGlOhAwW4scifcytrY0HgkvH_32vsafylrtP94AMNowau_zh64uiJgw_t0kPM
ContentType Conference Proceeding
DBID ADTOC
UNPAY
DOI 10.1145/3406325.3451125
DatabaseName Unpaywall for CDI: Periodical Content
Unpaywall
Database_xml – sequence: 1
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
ExternalDocumentID 10.1145/3406325.3451125
GroupedDBID ADTOC
UNPAY
ID FETCH-LOGICAL-a334t-d313a4f5747a3fa3eb7fa1b56c63b1335402a21d2cb63f15139e30354d47be123
IEDL.DBID UNPAY
IngestDate Sun Oct 26 04:08:27 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a334t-d313a4f5747a3fa3eb7fa1b56c63b1335402a21d2cb63f15139e30354d47be123
OpenAccessLink https://proxy.k.utb.cz/login?url=https://dl.acm.org/doi/pdf/10.1145/3406325.3451125
ParticipantIDs unpaywall_primary_10_1145_3406325_3451125
PublicationCentury 2000
PublicationDate 2021-06-15
PublicationDateYYYYMMDD 2021-06-15
PublicationDate_xml – month: 06
  year: 2021
  text: 2021-06-15
  day: 15
PublicationDecade 2020
PublicationTitle Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
PublicationYear 2021
Score 2.5566983
SourceID unpaywall
SourceType Open Access Repository
Title The complexity of constrained min-max optimization
URI https://dl.acm.org/doi/pdf/10.1145/3406325.3451125
UnpaywallVersion publishedVersion
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEB1qe1AvKlb8Zg9ePKR287XtUcRSBEsPFuppSTYJiN1tqbtY_fVO2lhFvPQYCCHJMHkvZN4LwBVSDm4od6TLO5J42SxRzlHCs7itOpZqzrx2-HEg-yP-MBbjGtBvLYyZ4Dj58gnf5_TMuGBoK24YYg-josW8pRYVW9CQAvl3HRqjwfD2Ofj2_NNzF7arYqY-3tVk8gs8ensrQd_b0nPQ14y8tqpSt7LPP46Mm81rH5o_Yr1ouIahA6jZ4hAohj9alovbBfLsaOqw5c1iFbJKE-UvBcnVIprigZEHJWYTRr37p7s-Cd8jEMUYL4lhMVPcCbwQKOYUszpxKtZCZpJpvHoiF6OKxoZmWjKHyM66FgFLcMMTbRGxjqBeTAt7DBGyOIG4H2dSYsxMW9GOTTC2CeZ8hgzpBK7XO5jOVjYY6UrSLNKw_jSs_3SDvmewQ32NiP8LSJxDvZxX9gJBvtSXIapfrDufng
linkProvider Unpaywall
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEB1qe1AvKlb8Zg9ePKR287XtUcRSBEsPFuppSTYJiN1tqbtY_fVO2lhFvPQYCCHJMHkvZN4LwBVSDm4od6TLO5J42SxRzlHCs7itOpZqzrx2-HEg-yP-MBbjGtBvLYyZ4Dj58gnf5_TMuGBoK24YYg-josW8pRYVW9CQAvl3HRqjwfD2Ofj2_NNzF7arYqY-3tVk8gs8ensrQd_b0nPQ14y8tqpSt7LPP46Mm81rH5o_Yr1ouIahA6jZ4hAohj9alovbBfLsaOqw5c1iFbJKE-UvBcnVIprigZEHJWYTRr37p7s-Cd8jEMUYL4lhMVPcCbwQKOYUszpxKtZCZpJpvHoiF6OKxoZmWjKHyM66FgFLcMMTbRGxjqBeTAt7DBGyOIG4H2dSYsxMW9GOTTC2CeZ8hgzpBK7XO5jOVjYY6UrSLNKw_jSs_3SDvmewQ32NiP8LSJxDvZxX9gJBvtSXIapfrDufng
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+53rd+Annual+ACM+SIGACT+Symposium+on+Theory+of+Computing&rft.atitle=The+complexity+of+constrained+min-max+optimization&rft.date=2021-06-15&rft_id=info:doi/10.1145%2F3406325.3451125&rft.externalDocID=10.1145%2F3406325.3451125