collaborators

1 paper

cs.CC2009

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

Kenya Ueno

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…