I'll respond until I pass out in a drunken stupor and then get back to you in the morning.
That particular problem sounds pretty trivial and could just be left to the interested reader. I'm sure no organizations would be interested if anybody could provide you and answer to that.
That particular problem sounds pretty trivial and could just be left to the interested reader. I'm sure no organizations would be interested if anybody could provide you and answer to that.
How can you prove whether or not, for all problems for which an algorithm can verify a given solution quickly (i.e., in polynomial time), an algorithm can also find that solution quickly?