VEST is W[2]-hard
Abstract
In this short note, we show that the problem of VEST is W[2]-hard for parameter k. This strengthens a result of Matousek, who showed W[1]-hardness of that problem. The consequence of this result is that computing the k-th homotopy group of a d-dimensional space for d > 3 is W[2]-hard for parameter k.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.