MFCS
2010
Springer
13 years 9 months ago
2010
Springer
Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectangle bound and introduced a technique called the LP bound, whi...
IPL
2006
13 years 11 months ago
2006
Valiant (1979) proved that every polynomial of formula size e is a projection of the (e + 2)
COCO
2005
Springer
14 years 4 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
STACS
2007
Springer
14 years 5 months ago
2007
Springer
We exactly determine the formula size of the parity function. If n = 2 + k, where 0 ≤ k < 2 , then the formula size of parity on n bits is 2 (2 + 3k) = n2 + k2 − k2 . Khrap...
STACS
2009
Springer
14 years 5 months ago
2009
Springer
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...