论文标题
背心是W [2] - hard
VEST is W[2]-hard
论文作者
论文摘要
在此简短说明中，我们表明背心的问题为$ W [2] $ - 对于参数$ k $很难。这加强了Matoušek的结果，Matoušek表现出了$ W [1] $ - 该问题的硬度。此结果的结果是，计算$ d $ d $二维空间的$ k $ th同拷贝组，$ d> 3 $ is $ w [2] $ - 对于参数$ k $很难。
In this short note, we show that the problem of VEST is $W[2]$-hard for parameter $k$. This strengthens a result of Matoušek, 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$.
