scientific article; zbMATH DE number 3261634
From MaRDI portal
zbMath0163.25801MaRDI QIDQ5547602
Publication date: 1964
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the optimality of Bellman-Ford-Moore shortest path algorithm, Directed monotone contact networks for threshold functions, Kolmogorov complexity arguments in combinatorics, On the Decomposition of Graphs, \(\Sigma\Pi\Sigma\) threshold formulas, On the Power of the Semi-Separated Pair Decomposition, Better lower bounds for monotone threshold formulas, Separating systems and oriented graphs of diameter two, On separating systems, Construction of universal enumerators and formulas for threshold functions, Bipartite Hansel results for hypergraphs, Geometric spanners for weighted point sets, Homogeneous formulas and symmetric polynomials, New bounds for perfect \(k\)-hashing, Pi-sigma-pi threshold formulas, Limitations of incremental dynamic programming, Lower bounds for the size of expressions for certain functions in d-ary logic, On minimal coverings of the Boolean cube by centered antichains, An information-theoretic method in combinatorial theory, A generalization of the Bollobás set pairs inequality, The covering problem of complete uniform hypergraphs, Region-fault tolerant geometric spanners, Beating Fredman-Komlós for Perfect k-Hashing., On Covering Numbers, Young Diagrams, and the Local Dimension of Posets, Beating Fredman-Komlós for perfect \(k\)-hashing, Asymptotic behavior of the chromatic index for hypergraphs
