# Re: Not constructive proof of existing of an algorithm

*From*: "Yajun" <yalding@xxxxxxxxx>*Date*: 21 Apr 2005 23:23:27 -0700

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?

regards,

yalding

.

**Follow-Ups**:**Re: Not constructive proof of existing of an algorithm***From:*Christian Kleinewaechter

**References**:**Not constructive proof of existing of an algorithm***From:*Iron Bone

**Re: Not constructive proof of existing of an algorithm***From:*Mike Robson

**Re: Not constructive proof of existing of an algorithm***From:*googmeister

- Prev by Date:
**Re: compression algorithm is NP complete problem?** - Next by Date:
**Re: Not constructive proof of existing of an algorithm** - Previous by thread:
**Re: Not constructive proof of existing of an algorithm** - Next by thread:
**Re: Not constructive proof of existing of an algorithm** - Index(es):