World's most popular travel blog for travel bloggers.

# polynomial time reduction of 2 langauges

, ,
Problem Detail:

If we can reduce a language y to x.

x ≤P y

how do I prove

 x(complement) ≤P  y (complement) 
###### Answered By : David Richerby

The definition of many-one reducibility means that, if you've proven that $X\leq Y$, you get $\overline{X}\leq\overline{Y}$ for free.

Best Answer from StackOverflow

Question Source : http://cs.stackexchange.com/questions/33242

3200 people like this