1 problem

Polynomial-time indistinguishability conjecture. Fix any $c>1$. There exists no polynomial-time algorithm that distinguishes the p-texttt{NPP} from the u-texttt{NPP} with probabili…