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

DOI10.1145/3519935.3519976OpenAlexW3142086151MaRDI QIDQ6083571FDOQ6083571

Authors: Tianqi Yang 

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

Boolean circuitsexplicit lower boundsgate eliminationaffine dispersers

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited In (3)

• Improving \(3N\) circuit complexity lower bounds
• CNF encodings of symmetric functions
• Explicit lower bound of 4.5n - o(n) for boolena circuits

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6083571)