2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1984)

Singer Island, FL

Oct. 24, 1984 to Oct. 26, 1984

ISBN: 0-8186-0591-X

pp: 506-515

J. Friedman , Harvard University

ABSTRACT

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/..

INDEX TERMS

CITATION

J. Friedman,
"Constructing O(n Log n) Size Monotone Formulae For The k-th Elementary Symmetric Polynomial Of n Boolean Variables",

*2013 IEEE 54th Annual Symposium on Foundations of Computer Science*, vol. 00, no. , pp. 506-515, 1984, doi:10.1109/SFCS.1984.715953