cs.CC · 2026-06-16 · No. 25

Computational Complexity, 2026-06-16.

1 new papers in cs.CC. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

1 entries
  1. 01

    The Complexity of Min-Max Optimization for Quadratic Polynomials

    Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alexandros Hollender

    cs.CC · cs.GT · cs.LG · math.OC

    We 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.

    arxiv.org/abs/2606.17000 · PDF

This edition is part of The Daily Abstract — cs.CC archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.