If we can reduce a language y to x.
x ≤P y
how do I prove
x(complement) ≤P y (complement)
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.Sign up to join this community