Pseudorandom Generators with Optimal Seed Length for Non-Boolean Poly-Size Circuits
Publication:4973883
DOI10.1145/3018057zbMath1427.68111OpenAlexW2608944290MaRDI QIDQ4973883
Sergei Artemenko, Ronen Shaltiel
Publication date: 6 December 2019
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3018057
Analysis of algorithms and problem complexity (68Q25) Random number generation in numerical analysis (65C10) Measures of information, entropy (94A17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items