recursions
  • Member for 6 years, 6 months
  • Last seen more than 5 years ago
How to solve this graph problem
Accepted answer
1 votes

This sounds like it would require checking all possible subsets. If so, you can solve the problem by enumerating every single subset and checking all of them, but that will not be practical for N > 10 ...

View answer
What are the implications of P=NP?
1 votes

If P=NP, then all of the NP problems can be solved deterministically in Polynomial time. This is because the NP problems are all essentially the same problem, just stated in different terms. As ...

View answer