The covering problem of complete uniform hypergraphs

A result of Krichevskii [3] and Hansel [1], concerning coverings of complete bipartite graphs is extended to hypergraphs, thus providing a lower bound on the lengths of Boolean formulas of a certain type realizing the threshold functions.