Derandomization from time-space tradeoffs

DOI10.4230/LIPICS.CCC.2022.37MaRDI QIDQ6568380zbMATH OpenFDO

Authors Oliver Korten

Publication date 5 July 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CCC.2022.37

zbMATH Keywords

circuit complexitypseudorandomnesstotal functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(1)

• Instance-wise hardness and refutation versus derandomization for Arthur-Merlin protocols

This page was built for publication: Derandomization from time-space tradeoffs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568380)