Randomized separations in black-box TFNP
Year: 2026
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Kiselev, Fedor
Institution: Moscow Institute of Physics and Technology
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7163558459
Cites:
Cited by:
Related to: