Can every randomized algorithm be derandomized?
From MaRDI portal
Publication:2931400
DOI10.1145/1132516.1132571zbMath1301.68136OpenAlexW2002946569MaRDI QIDQ2931400
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132571
probabilistic algorithmscircuit complexityderandomizationpseudo-randomnesscomplexity classesalgebraic circuit complexity
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20)
Related Items