Explore
AI Tools
New Tools
AI Agents
One9 Worker
LLMs
RAG & Vector DBs
Research
Assemble a stack
Founder Stacks
Compare
How We Rate
About
$
/
₹
⌘K
Sign up free
Login
Back to papers
June 15, 2026
cs.CC
cs.GT
cs.LG
math.OC
The Complexity of Min-Max Optimization for Quadratic Polynomials
Martino Bernasconi
,
Matteo Castiglioni
,
Andrea Celli
,
Alexandros Hollender
Original Abstract
Read on arXiv
Download PDF
Categories
cs.CC, cs.GT, cs.LG, math.OC