I've seen in many textbooks if say we have a problem $Q$, we write a non-deterministic algorithm in polynomial time to solve problem $Q$, and then from that point it results that $Q\in NP$. Why is that? Just because we could write a non-deterministic algorithm in polynomial time? Can't we do that for every problem?
Asked
Active
Viewed 18 times
