@inbook{63b19e96bba3430a8b17bb4116cd2813,
title = "Two comments on targeted canonical derandomizers",
abstract = "We revisit the notion of a targeted canonical derandomizer, introduced in our prior work (ECCC, TR10-135) as a uniform notion of a pseudorandom generator that suffices for yielding BPP=P. The original notion was derived (as a variant of the standard notion of a canonical derandomizer) by providing both the distinguisher and the generator with the same auxiliary-input. Here we take one step further and consider pseudorandom generators that fool a single circuit that is given to both (the distinguisher and the generator) as auxiliary input. Building on the aforementioned prior work, we show that such pseudorandom generators of constant seed length exist if and only if BPP=P, which means that they exist if and only if the previously defined targeted canonical derandomizers (of exponential stretch, as in the prior work) exist. We also relate such targeted canonical derandomizer to targeted hitters, which are the analogous canonical derandomizers for RP.",
author = "Oded Goldreich",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2020.",
year = "2020",
month = apr,
day = "4",
doi = "10.1007/978-3-030-43662-9_4",
language = "الإنجليزيّة",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "24--35",
editor = "Oded Goldreich",
booktitle = "Computational Complexity and Property Testing",
address = "ألمانيا",
}