Hi stuck on the paragraph below,

“Note that iE′ cannot be used more than ≈n/K times on expectation when A is run on E. … To make the two algorithms essentially indistinguishable, set Δ=1/sqrt(n/K).”

I was wondering how to decide the value of Δ in order to have indistinguishable environments and its relation to the aforementioned inequality based on multiple integration by parts.

Many thanks for any help

]]>Thanks for the comment. You are right: $n$ should have been $t$ here. Oh, and I edited the page to reflect this.

– Csaba ]]>