Re: basic query regarding NP Complete...

Kai Schories wrote:

...) regarding the following. Find a polynominal-time function f_A which maps
SAT's input to a representation of A's input (i write: SAT <=p A , which means
'SAT p-reducible A'). So each instance of SAT can be solved as instance of A.

As an addendum: The important thing here is that yes-instances of SAT must be
mapped to yes-instances of A and no-instances of SAT must be mapped to
no-instances of A.
.