AI Chat AI Image Generator AI Video Text to Speech

VEST is W[2]-hard

09/20/2022

∙

by Michael Skotnica, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 07/02/2021

Linear Discrepancy is Π_2-Hard to Approximate

In this note, we prove that the problem of computing the linear discrepa...

0 Pasin Manurangsi, et al. ∙

research

∙ 06/24/2021

Kemeny ranking is NP-hard for 2-dimensional Euclidean preferences

The assumption that voters' preferences share some common structure is a...

0 Bruno Escoffier, et al. ∙

research

∙ 06/21/2001

A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs

We show that computing the lexicographically first four-coloring for pla...

0 André Grosse, et al. ∙

research

∙ 12/21/2021

The entropic barrier is n-self-concordant

For any convex body K ⊆ℝ^n, S. Bubeck and R. Eldan introduced the entrop...

0 Sinho Chewi, et al. ∙

research

∙ 02/28/2022

A Note on the Hardness of Problems from Cryptographic Group Actions

Given a cryptographic group action, we show that the Group Action Invers...

0 Giuseppe D'Alconzo, et al. ∙

research

∙ 07/19/2023

A Note on Hardness of Computing Recursive Teaching Dimension

In this short note, we show that the problem of computing the recursive ...

0 Pasin Manurangsi, et al. ∙

research

∙ 01/12/2023

Hardness of Ruling Out Short Proofs of Kolmogorov Randomness

A meta-complexity assumption, Feasible Chaitin Incompleteness (FCI), ass...

0 Hunter Monroe, et al. ∙