General Pseudo-random Generators from Weaker Models of Computation

DOI10.1007/978-3-642-10631-6_110zbMath1273.68267OpenAlexW2150510576MaRDI QIDQ3652295

George Karakostas

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_110

zbMATH Keywords

circuit complexitypseudo-random generatorsmonotone circuit complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

On derandomization and average-case complexity of monotone functions

This page was built for publication: General Pseudo-random Generators from Weaker Models of Computation