3.1 n − o ( n ) circuit lower bounds for explicit functions

DOI10.1145/3519935.3519976OpenAlexW3142086151MaRDI QIDQ6083571

Tianqi Yang, Unnamed Author

Publication date: 8 December 2023

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

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

zbMATH Keywords

explicit lower boundsBoolean circuitsgate eliminationaffine dispersers

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Improving \(3N\) circuit complexity lower bounds

This page was built for publication: 3.1 n − o ( n ) circuit lower bounds for explicit functions