2016年3月23日 · $\begingroup$ @Macrophage, firstly, I was using the first definition of ZPP, and secondly, in second definition you will need to bound incorrect yes answers with less than 1/2 probability. So, there too you may have to run the algorithm multiple times. $\endgroup$

2019年7月18日 · Therefore, given a solver for ZPP problems, I can create a function which either solves my problem or abort in $\frac{1}{3}$ of the cases, while running in polynomial time $^1$. Given this function, I can solve any problem contained in BPP by running the function created above on it and return a random response if it aborts.

2023年6月18日 · Stack Exchange Network. Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

My problem is formulating a similar alternative definition for $\mathrm{ZPP}$. $\mathrm{ZPP}$ can be defined as the class of languages with a randomized algorithm that always outputs the correct answer, and for every input the expected running time of the algorithm is polynomial.

2017年8月24日 · Stack Exchange Network. Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

2020年6月6日 · Theoretically, ZPP = EXPTIME implies EXPTIME $\subseteq$ BPP. Since we already know P $\subset$ EXPTIME we have P $\subset$ BPP as well, which means there are some polynomial-time randomized algorithms that cannot be derandomized. This is another way of saying that pseudo-random number generators will never be as effective as true …

2015年8月21日 · Stack Exchange Network. Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

2015年12月24日 · zpp package. Discussion in 'E46 (1999-2006)' started by ramondaze, Dec 24, 2015. Member ramondaze. Post ...

2020年3月31日 · Stack Exchange Network. Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

In particular, the second level of CH collapses to $\mathrm{PP^{PP}=PP^{ZPP}}$, but not to $\mathrm{ZPP^{ZPP}}$. Thus, ZPP being low for itself is irrelevant, you’d need $\mathrm{PP^{ZPP}=PP}$ for the argument to go through. (However, the conclusion $\mathrm{PH=ZPP}$ is correct, as $\mathrm{PH\subseteq P^{PP}}$.) $\endgroup$ –