a stronger lp bound for formula size lower bounds via clique constraints：一个更强大的线性约束的公式大小下界通过集团的限制.pdf

Theoretical Computer Science 434 (2012) 87–97 Contents lists available at SciVerse ScienceDirect Theoretical Computer Science journal homepage: /locate/tcs A stronger LP bound for formula size lower bounds via clique constraints✩ Kenya Ueno ∗ Young Researcher Development Center and Graduate School of Informatics, Kyoto University, Yoshida Honmachi, Sakyo-ku, Kyoto 606-8501, Japan a r t i c l e i n f o a b s t r a c t Article history: We introduce a new technique proving formula size lower bounds based on the linear Received 7 December 2010 programming bound originally introduced by Karchmer, Kushilevitz and Nisan and the Received in revised form 26 January 2012 theory of stable set polytopes. We apply it to majority functions and prove their formula Accepted 5 February 2012 size lower bounds improved from the classical result of Khrapchenko. Moreover, we Communicated by M. Kiwi introduce a notion of unbalanced recursive ternary majority functions motivated by a decomposition theory of monotone self-dual functions and give matching upper and Keywords: lower bounds of their formula size. We also show monotone formula size lower bounds Formula size lower bound Linear programming of balanced recursive ternary majority functions improved from the quantum adversary Monotone self-dual Boolean function bound of Laplante, Lee and Szegedy. Stable set polytope