A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
In this paper, we explore possibilities and difficulties to prove super-quadratic formula size lower bounds from the following aspects. First, we consider recursive Boolean functions and prove their general formula size upper bounds. We also discuss recursive Boolean functions based on exact 2-bit functions. We show that their formula complexity are at least Ω(n 2 ). Hence they can be candidate Boolean functions to prove super-quadratic formula size lower bounds. Next, we consider the reason ofdoi:10.1587/transinf.2014fcp0011 fatcat:vdirtm3jkrhonofaoohtcvnho4