Sharp threshold results for computational complexity

DOI10.1145/3357713.3384283OpenAlexW3034628227MaRDI QIDQ5145017

Ce Jin, Lijie Chen, R. Ryan Williams

Publication date: 19 January 2021

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

Full work available at URL: https://doi.org/10.1145/3357713.3384283

zbMATH Keywords

De Morgan formulasquantified derandomizationhardness magnification

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

Quantified Derandomization: How to Find Water in the Ocean ⋮ Algorithms and lower bounds for comparator circuits from shrinkage ⋮ Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization ⋮ On hitting-set generators for polynomials that vanish rarely

This page was built for publication: Sharp threshold results for computational complexity