We give a $3.5n-o(n)$ lower bound on the size of Boolean circuits over the $B_2$ basis computing an explicit Boolean function F in P. This improves the best previous lower bound of $3.1n-o(n)$ [Li-Yang22].

The proof of the lower bound uses the gate elimination technique, and builds heavily on ideas ... more >>>