<journal article>
A note on the quasi-additive bound for Boolean functions
Creator | |
---|---|
Language | |
Publisher | |
Date | |
Source Title | |
Vol | |
Issue | |
First Page | |
Last Page | |
Publication Type | |
Access Rights | |
Related DOI | |
Related DOI | |
Related URI | |
Relation | |
Abstract | 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 li...near programming relaxation of some integer programming for computing the protocol partition number.show more |
Hide fulltext details.
File | FileType | Size | Views | Description |
---|---|---|---|---|
2012B-6 | 97.3 KB | 185 |
Details
Record ID | |
---|---|
Peer-Reviewed | |
Subject Terms | |
ISSN | |
NCID | |
Notes | |
Type | |
Created Date | 2014.01.07 |
Modified Date | 2022.01.24 |