A Relation between the Protocol Partition Number and the Quasi-Additive Bound
Computational Complexity
2010-12-24 v1
Abstract
In this note, we show that the linear programming for computing the quasi-additive bound of the formula size of a Boolean function presented by Ueno [MFCS'10] is equivalent to the dual problem of the linear programming relaxation of an integer programming for computing the protocol partition number. Together with the result of Ueno [MFCS'10], our results imply that there exists no gap between our integer programming for computing the protocol partition number and its linear programming relaxation.
Keywords
Cite
@article{arxiv.1012.5130,
title = {A Relation between the Protocol Partition Number and the Quasi-Additive Bound},
author = {Naoyuki Kamiyama},
journal= {arXiv preprint arXiv:1012.5130},
year = {2010}
}