Metraipolis › archive › dc_5c56ef30950a

Integer Quadratic Programming is W[1]-Hard Parameterized by the Number of Variables — arXiv:2608.17818

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.17818
License (as archived)
CC0-1.0
Archived
2026-10-18T15:33:30.613Z
SHA-256 of the archived text
ffa1878958362f81f4d3e952744219cce2f50c60fd7e06ec43885ec96945d7f6
Stable URL of this page
https://metraipolis.com/documento/dc_5c56ef30950a

How to cite

Integer Quadratic Programming is W[1]-Hard Parameterized by the Number of Variables — arXiv:2608.17818 — arXiv (en), https://arxiv.org/abs/2608.17818 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5c56ef30950a (Metraipolis archive dc_5c56ef30950a, sha256 ffa1878958362f81f4d3e952744219cce2f50c60fd7e06ec43885ec96945d7f6)
BibTeX
@misc{dc5c56ef30950a,
  title = {Integer Quadratic Programming is W[1]-Hard Parameterized by the Number of Variables — arXiv:2608.17818},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.17818},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5c56ef30950a; sha256 ffa1878958362f81f4d3e952744219cce2f50c60fd7e06ec43885ec96945d7f6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.17818. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We show that Integer Quadratic Programming is W[1]-hard parameterized by the number of variables. Thus, under standard complexity assumptions, Integer Quadratic Programming cannot be solved in f(n)|I|^{O(1)} time for any computable function f where |I| is the size of the encoding and n is the number of variables.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-19 in cs.DS).
Categorie arXiv: Computational Complexity (cs.CC) ; Data Structures and Algorithms (cs.DS); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2608.17818 — 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-10-18T15:28:41.546Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-19?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).