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

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

2009-02-12

arxiv.org/abs/0902.2146v1

26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009 (2009) 433-444

Computer Science

Computational Complexity

Scientific paper

We 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].

Affiliated with

Also associated with

No associations

Rating

A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-556716