A note on the quasi-additive bound for Boolean functions
Naoyuki Kamiyama · QIR (Kyushu University Institutional Repository) (Kyushu University) · 2012
In this note, we prove that the linear programming for computing the quasi-additive bound of the formula size of a Boolean function presented by Ueno (2010) is equivalent to the dual problem of the linear programming relaxation of some integer programming for computing the protocol partition number.