Home Science Randomized separations in black-box TFNP
Science

Randomized separations in black-box TFNP

Key Points

arXiv:2606.04697v1 Announce Type: new Abstract: We study the relationship between deterministic and randomized black-box reducibility between problems in TFNP. Our main contribution is a general technique that establishes equivalence between these reducibility types from specific TFNP problems to any TFNP problem. In particular, we show that this equivalence holds for reductions from complete problems in PPP, PPAD, PPA, and $t$-PPP.

arXiv:2606.04697v1 Announce Type: new Abstract: We study the relationship between deterministic and randomized black-box reducibility between problems in TFNP. Our main contribution is a general technique that establishes equivalence between these reducibility types from specific TFNP problems to any TFNP problem. In particular, we show that this equivalence holds for reductions from complete problems in PPP, PPAD, PPA, and $t$-PPP. In turn, it strengthens all known black-box separations, originating from these classes, to randomized separations.
TFNP (ORG) PPP (ORG) PPAD (ORG) PPA (ORG)
Originally published by arXiv CS Read original →