Re: Not constructive proof of existing of an algorithm

I am confused during the reading of the description. How about one
finally prove that the "computation of the obstruction set" is NP-Hard?
If there is no way in Polynomial time(if P != NP) to get the
obstruction set, how can we say we can do something in polynomial time
assuming the knowledge of obstruction set?