Finding the minimum number of coordinates to change to get a vector inside a subspace
This problem is NP-hard in general.

This is equivalent to finding the sparsest vector $y\in \mathbb F^n$ such that 
$$Ay = -Ax$$

As finding a sparsest solution vector for an underdetermined system of linear equations is NP-hard, so is your problem.