Two applications (for search theory and truth functions) of Sperner type theorems
From MaRDI portal
Publication:2562082
DOI10.1007/BF02018457zbMath0266.05001OpenAlexW2036517292MaRDI QIDQ2562082
Publication date: 1973
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02018457
Related Items (57)
Non-uniform covering array with symmetric forbidden edge constraints ⋮ Sperner capacities ⋮ On the extremal combinatorics of the Hamming space ⋮ Extremal problems for finite sets and convex hulls---a survey ⋮ Binary covering arrays on tournaments ⋮ Suitable Permutations, Binary Covering Arrays, and Paley Matrices ⋮ Further results on the covering radius of small codes ⋮ On the maximum number of qualitative independent partitions ⋮ On Generalized Turán Results in Height Two Posets ⋮ Covering arrays from \(m\)-sequences and character sums ⋮ An Erdős-Ko-Rado theorem for the derangement graph of PGL(\(2,q\)) acting on the projective line ⋮ Augmentation of covering arrays of strength two ⋮ Constructing new covering arrays from LFSR sequences over finite fields ⋮ Locating and detecting arrays for interaction faults ⋮ On maximal families of subsets of a finite set ⋮ A greedy-metaheuristic 3-stage approach to construct covering arrays ⋮ Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods ⋮ Sperner type theorems and complexity of minimal disjunctive normal forms of monotone Boolean functions ⋮ New optimal covering arrays using an orderly algorithm ⋮ A greedy algorithm to construct covering arrays using a graph representation ⋮ Tilted Sperner families ⋮ Incoherent majorities: the McGarvey problem in judgement aggregation ⋮ Structures and lower bounds for binary covering arrays ⋮ Strong qualitative independence. ⋮ Sperner families satisfying additional conditions and their convex hulls ⋮ Rényi 100, quantitative and qualitative (in)dependence ⋮ Unnamed Item ⋮ How to guess two letters correctly ⋮ Classification of orthogonal arrays by integer programming ⋮ Randomized post-optimization of covering arrays ⋮ Covering arrays from cyclotomy ⋮ New covering array numbers ⋮ Consecutive covering arrays and a new randomness test ⋮ Covering and radius-covering arrays: constructions and classification ⋮ Partial covering arrays: algorithms and asymptotics ⋮ Graph-intersecting set systems and LYM inequalities ⋮ Optimal and near-optimal mixed covering arrays by column expansion ⋮ On the number of containments in \(P\)-free families ⋮ The covering radius of extreme binary 2-surjective codes ⋮ On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\) ⋮ On the capacity of Boolean graph formulæ ⋮ Covering arrays: using prior information for construction, evaluation and to facilitate fault localization ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ t-Covering Arrays: Upper Bounds and Poisson Approximations ⋮ Merging covering arrays and compressing multiple sequence alignments ⋮ Disjoint Spread Systems and Fault Location ⋮ Cover starters for covering arrays of strength two ⋮ \(m\)-qualitatively independent families ⋮ Generalized forbidden subposet problems ⋮ Covering arrays on graphs ⋮ On qualitatively independent partitions and related problems ⋮ Intersecting Sperner families and their convex hulls ⋮ MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays ⋮ Upper Bounds on the Size of Covering Arrays ⋮ Polytopes determined by hypergraph classes ⋮ On the state of strength-three covering arrays ⋮ Binary consecutive covering arrays
Cites Work
This page was built for publication: Two applications (for search theory and truth functions) of Sperner type theorems
