Metraipolis › archive › dc_6eced4b6517c
The Complexity of KKT Points of Quadratic Programs with Polynomially-Bounded Coefficients — arXiv:2611.03945
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.03945
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T21:56:08.203Z
- SHA-256 of the archived text
04fead6033f68b57415ab5b55db0637ff29c8b597695a55cd48d1262b4b34c55- Stable URL of this page
https://metraipolis.com/documento/dc_6eced4b6517c
How to cite
The Complexity of KKT Points of Quadratic Programs with Polynomially-Bounded Coefficients — arXiv:2611.03945 — arXiv (en), https://arxiv.org/abs/2611.03945 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6eced4b6517c (Metraipolis archive dc_6eced4b6517c, sha256 04fead6033f68b57415ab5b55db0637ff29c8b597695a55cd48d1262b4b34c55)
BibTeX
@misc{dc6eced4b6517c,
title = {The Complexity of KKT Points of Quadratic Programs with Polynomially-Bounded Coefficients — arXiv:2611.03945},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.03945},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6eced4b6517c; sha256 04fead6033f68b57415ab5b55db0637ff29c8b597695a55cd48d1262b4b34c55},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03945. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Computing a Karush-Kuhn-Tucker (KKT) point of a quadratic polynomial over the unit hypercube is known to be $CLS$-complete, when the coefficients of the polynomial are encoded in binary. We prove that the problem remains $CLS$-complete even when the coefficients are encoded in unary. This is the first problem proven to remain $CLS$-hard when the input is given in unary. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Computational Complexity (cs.CC) ; Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2611.03945 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-04T21:40:34.549Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).