English

VEST is W[2]-hard

Computational Complexity 2022-09-21 v1

Abstract

In this short note, we show that the problem of VEST is W[2]W[2]-hard for parameter kk. This strengthens a result of Matou\v{s}ek, who showed W[1]W[1]-hardness of that problem. The consequence of this result is that computing the kk-th homotopy group of a dd-dimensional space for d>3d > 3 is W[2]W[2]-hard for parameter kk.

Cite

@article{arxiv.2209.09788,
  title  = {VEST is W[2]-hard},
  author = {Michael Skotnica},
  journal= {arXiv preprint arXiv:2209.09788},
  year   = {2022}
}

Comments

5 pages, 2 figures

R2 v1 2026-06-28T01:44:55.533Z