This Article 
 Bibliographic References 
 Add to: 
25th Annual Symposium on Foundations of Computer Science (FOCS 1984)
Singer Island, FL
October 24-October 26
ISBN: 0-8186-0591-X
J. Friedman, Harvard University
In this paper, we construct formulae for the k-th elementary symmetry polynomial of n Boolean variables, using only conjunction and disjunction, which for fixed k are of size O(n log n), with the construction taking time polynomial in n. We also prove theorems involving n log n/spl middot/(polynomial in k) upper bounds on such formulae. Our methods involve solving the following combinatorial problem: for fixed k and any n construct a collection of r=O(log n) functions f/sub 1/,...,f/sub r/ from {1,...,n} to {1,...,K} such that any subset of {1,...,n} of order k is mapped 1-1 to {1,...,k} by at least one f/sub i/..
J. Friedman, "Constructing O(n Log n) Size Monotone Formulae For The k-th Elementary Symmetric Polynomial Of n Boolean Variables," focs, pp.506-515, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984
Usage of this product signifies your acceptance of the Terms of Use.