Explicit lower bound of 4.5n - o(n) for boolena circuits
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of depth-3 circuits computing symmetric Boolean functions
Information Processing Letters
Reductions for monotone Boolean circuits
Theoretical Computer Science
ACM SIGACT News
On the Power of Small-Depth Computation
Foundations and Trends® in Theoretical Computer Science
A well-mixed function with circuit complexity 5n ± o(n): tightness of the Lachish-Raz-type bounds
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Circuit complexity and multiplicative complexity of Boolean functions
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Uniform derandomization from pathetic lower bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A well-mixed function with circuit complexity 5n: Tightness of the Lachish-Raz-type bounds
Theoretical Computer Science
Non-local box complexity and secure function evaluation
Quantum Information & Computation
Reductions for monotone boolean circuits
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Negation-Limited complexity of parity and inverters
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A 5n−o(n) lower bound on the circuit size over U2 of a linear Boolean function
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
| Hi-index | 0.00 |
The current best lower bound of 4.5n - o(n) for an explicit family of Boolean circuits [3] is improved to 5n - o(n) using the same family of Boolean function.