Problems with guaranteed-to-exist solutions (like this one, & others in PPA, PPAD, etc.) are not NP-complete unless NP = coNP and the Polynomial Hierarchy collapses. Now, we don't yet know that P != NP, or even that P != PH.

## Re: A little more

Problems with guaranteed-to-exist solutions (like this one, & others in PPA, PPAD, etc.) are not NP-complete unless NP = coNP and the Polynomial Hierarchy collapses. Now, we don't yet know that P != NP, or even that P != PH.