A Relation between the Protocol Partition Number and the Quasi-Additive Bound

Details A Relation between the Protocol Partition Number and the Quasi-Additive Bound A Relation between the Protocol Partition Number and the Quasi-Additive Bound

2010-12-23

arxiv.org/abs/1012.5130v1

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Relation between the Protocol Partition Number and the Quasi-Additive Bound 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 Relation between the Protocol Partition Number and the Quasi-Additive Bound, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Relation between the Protocol Partition Number and the Quasi-Additive Bound will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-295867