I'm thinking that since we can construct a non-deterministic turing machine to decides the language A, a subset of the language can also be decided by another non deterministic Turing Machine in polynomial time. Is this correct? How do we prove this?
If A is in NP. is any subset of A also in NP?
time complexity;np