Uniform Derandomization from Pathetic Lower Bounds

DOI10.1007/978-3-642-15369-3_29zbMath1305.68326OpenAlexW2157709541MaRDI QIDQ3588422

Fengming Wang, V. Arvind, Eric W. Allender

Publication date: 10 September 2010

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15369-3_29

zbMATH Keywords

circuit complexityderandomizationpolynomial identity testing

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

This page was built for publication: Uniform Derandomization from Pathetic Lower Bounds