Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace

DOI10.1145/3055399.3055414zbMath1370.68107arXiv1610.01199OpenAlexW2528399249MaRDI QIDQ4978009

William M. Hoza, Chris Umans

Publication date: 17 August 2017

Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.01199

zbMATH Keywords

derandomizationpseudorandom generatorsspace complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20)

Related Items (2)

Simple Optimal Hitting Sets for Small-Success RL ⋮ Unnamed Item

This page was built for publication: Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace