Complex sentence: The bound for the list size at worst case is n ^, and it can be reduced to a relative small bound O (1 /\\ varepsilon ^ 2) by using subspace-evasive subsets.
Split into simpler sentences: The bound for the list-size at worst case is n ^. And it can be reduced to a relative small bound O (1 /\\ varepsilon ^ 2) by using subspace-evasive subsets.