A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints

Simple item page
dc.creatorUeno, Kenya
dc.date2009-02-12
dc.date.accessioned2026-07-07T12:40:59Z
dc.date.available2026-07-07T12:40:59Z
dc.descriptionWe introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of stable set polytope. We apply it to majority functions and prove their formula size lower bounds improved from the classical result of Khrapchenko [13]. Moreover, we introduce a notion of unbalanced recursive ternary majority functions motivated by a decomposition theory of monotone self-dual functions and give integrally matching upper and lower bounds of their formula size. We also show monotone formula size lower bounds of balanced recursive ternary majority functions improved from the quantum adversary bound of Laplante, Lee and Szegedy [15].
dc.identifierhttps://arxiv.org/abs/0902.2146
dc.identifierhttp://arxiv.org/abs/0902.2146
dc.identifier26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009 (2009) 433-444
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/219618
dc.subjectComputational Complexity
dc.titleA Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
dc.typetext

Files

Collections

arXiv