English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Efficient derandomization has long been a goal in complexity theory, and amajor recent result by Yanyi Liu and Rafael Pass identifies a new class ofhardness assumption under which it is possible to perform time-boundedderandomization efficiently: that of ''leakage-resilient hardness.'' Theyidentify a specific form of this assumption which is $\textit{equivalent}$ to$\mathsf{prP} = \mathsf{prBPP}$. In this paper, we pursue a an equivalence toderandomization of $\mathsf{prBP{\cdot}L}$ (logspace promise problems withtwo-way randomness) through techniques analogous to Liu and Pass. We are ableto obtain an equivalence between a similar ''leakage-resilient hardness''assumption and a slightly stronger statement than derandomization of$\mathsf{prBP{\cdot}L}$, that of finding ''non-no'' instances of ''promisesearch problems.''

Leakage-Resilient Hardness Equivalence to Logspace Derandomization