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

DOI10.1145/3519935.3519976MaRDI QIDQ6083571zbMATH OpenOpenAlexFDO

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

affine dispersersBoolean circuitsexplicit lower boundsgate elimination

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(12)

• Explicit lower bound of 4.5n - o(n) for boolena circuits
• Improving \(3N\) circuit complexity lower bounds
• CNF encodings of symmetric functions
• Explicit directional affine extractors and improved hardness for linear branching programs
• Two-source and affine non-malleable extractors for small entropy
• Polynomial formulations as a barrier for reduction-based hardness proofs
• Hilbert functions and low-degree randomness extractors
• Boolean circuit complexity and two-dimensional cover problems
• Depth-three circuits for inner product and majority functions
• Polynomial-time pseudodeterministic construction of primes
• Oblivious complexity classes revisited: lower bounds and hierarchies
• Low-degree polynomials are good extractors

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)