{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreigppqaxpwqff6fc4bfbzbwbx4flmnwwvteuoyt63vuvpq7cyq2uxe",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mof4fot6j6l2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2606.17000v1",
  "publishedAt": "2026-06-16T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Martino Bernasconi",
    "Matteo Castiglioni",
    "Andrea Celli",
    "Alexandros Hollender"
  ],
  "textContent": "**Authors:** Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alexandros Hollender\n\nWe prove that computing approximate stationary points of min-max optimization over the hypercube is PPAD-hard for quadratic polynomials. This holds even when the polynomials are multilinear, each variable appears in at most three monomials, and the approximation factor is inverse polynomial. As a direct consequence, we obtain the first PPAD-hardness results for two-team zero-sum polymatrix games.",
  "title": "The Complexity of Min-Max Optimization for Quadratic Polynomials"
}