On the football pool problem for 6 matches: A new upper bound
From MaRDI portal
Publication:594884
DOI10.1016/0097-3165(83)90032-8zbMath0526.05019MaRDI QIDQ594884
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(83)90032-8
05B40: Combinatorial aspects of packing and covering
Related Items
Upper bounds for football pool problems and mixed covering codes, The football pool problem for 6 matches: A new upper bound obtained by simulated annealing, Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces, Bounds for binary multiple covering codes, New upper bounds for the football pool problem for 11 and 12 matches, A new lower bound for the football pool problem for six matches
Cites Work