Skip to main content
1 of 2

Largest subspace that doesn't intersect a given set

Let V be a vector space over Z/2, and let X be a subset of V. Is there an algorithm to find the largest possible subspace of V which doesn't intersect X? Is it NP complete?