Learning versus pseudorandom generators in constant parallel time

DOI10.4230/LIPICS.ITCS.2023.70MaRDI QIDQ6610340zbMATH OpenFDO

Authors Shuichi Hirahara, Mikito Nanashima

Publication date 25 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ITCS.2023.70

zbMATH Keywords

fixed-parameter tractabilityPAC learningaverage-case complexityparallel cryptographypolynomial-stretch pseudorandom generators in NC\(^0\)

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Learning versus pseudorandom generators in constant parallel time

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