VEST is W[2]-hard

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.Comment: 5 pages, 2 figure

    Similar works

    Full text

    thumbnail-image

    Available Versions