A general technique establishes equivalence of deterministic and randomized black-box reductions from complete problems in PPP, PPAD, PPA, and t-PPP to TFNP problems, strengthening known separations to randomized versions.
Title resolution pending
1 Pith paper cite this work, alongside 14 external citations. Polarity classification is still indexing.
1
Pith paper citing it
14
external citations · external index
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Randomized separations in black-box TFNP
A general technique establishes equivalence of deterministic and randomized black-box reductions from complete problems in PPP, PPAD, PPA, and t-PPP to TFNP problems, strengthening known separations to randomized versions.