Title :
Constructing O(n Log n) Size Monotone Formulae For The k-th Elementary Symmetric Polynomial Of n Boolean Variables
Author_Institution :
Harvard University
Keywords :
Costs; Error correction codes; Linear code; Polynomials; Reed-Solomon codes; Upper bound;
Conference_Titel :
Foundations of Computer Science, 1984. 25th Annual Symposium on
Print_ISBN :
0-8186-0591-X
DOI :
10.1109/SFCS.1984.715953
