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.
['Kazuo Iwama', 'Hiroki Morizumi']
An explicit lower bound of 5n - o(n) for Boolean circuits