Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > TEJAS NAREDDY:
All reports by Author Tejas Nareddy:

TR25-157 | 8th September 2025
Tejas Nareddy, Abhishek Mishra

Recovery Reductions, Conjectures, and Barriers

We introduce and initiate the study of a new model of reductions called the random noise model. In this model, the truth table $T_f$ of the function $f$ is corrupted on a randomly chosen $\delta$-fraction of instances. A randomized algorithm $\mathcal{A}$ is a $\left(t, \delta, 1-\varepsilon\right)$-recovery reduction for $f$ if:

... more >>>



ISSN 1433-8092 | Imprint