COVERING PROBLEM OF COMPLETE UNIFORM HYPERGRAPHS

被引：8

作者：

SNIR, M

机构：

[1] Department of Computer Science, Hebrew University of Jerusalem

来源：

DISCRETE MATHEMATICS | 1979年 / 27卷 / 01期

关键词：

D O I：

10.1016/0012-365X(79)90074-8

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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. © 1979.

引用

页码：103 / 105

页数：3