1
$\begingroup$

There are now many examples of "natural" (no mention of circuits) problems which have been proven to be complete for classical TFNP classes---these include Consensus Halving for PPA and Blichfeldt for PPP. Is there such an example which might be considered the simplest?

asked Nov 3 at 19:16
$\endgroup$
1
  • $\begingroup$ Simplest in what sense? Anyhow, my favorite is Necklace Splitting. $\endgroup$ Commented Nov 8 at 13:34

1 Answer 1

0
$\begingroup$

Maybe WEAK-PIGEON, which is complete for PWPP by definition? The input is a circuit $C: \{0, 1\}^n \to \{0, 1\}^{n - 1}$, and the goal is to find distinct $x, y \in \{0, 1\}^n$ such that $C(x) = C(y)$.

answered Nov 4 at 4:33
$\endgroup$
1
  • $\begingroup$ That is not a natural problem $\endgroup$ Commented Nov 4 at 13:38

Your Answer

Draft saved
Draft discarded

Sign up or log in

Sign up using Google
Sign up using Email and Password

Post as a guest

Required, but never shown

Post as a guest

Required, but never shown

By clicking "Post Your Answer", you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.