39152
Since all problems in NP can be reduced to , it follows that for every problem in NP we can construct a non-deterministic Turing machine that decides its complement in polynomial time , i.e. , NP & sube ; co-NP .
 None
Please list all entity words in the text that fit the category. Output format is "word1, word2". 
Option: location, person, organization 
Text: {0} 
Answer:
 None