A new lower bound for the football pool problem for six matches
type: Item
instance of: scholarly article
title: A new lower bound for the football pool problem for six matches
zbMATH Open document ID: 1016.94044
author: Alfred Wassermann
author: Patric R. J. Östergård
published in: Journal of Combinatorial Theory. Series A
publication date: 2003-03-26T00:00:00Z
Mathematics Subject Classification ID: 94B75
Mathematics Subject Classification ID: 11Y40
zbMATH DE Number: 1888408
zbMATH Keywords: covering radius
zbMATH Keywords: football pool problem
zbMATH Keywords: LLL algorithm
zbMATH Keywords: ternary code
describes a project that uses: nauty
MaRDI profile type: Publication
full work available at URL: jcta.2002.3260
OpenAlex ID: W1965348767
cites work: Lower bounds for \(q\)-ary coverings by spheres of radius one
cites work: The football pool problem for 5 matches
cites work: New upper bounds for the football pool problem for 6, 7, and 8 matches
cites work: Isomorph-Free Exhaustive Generation
cites work: A combinatorial proof for the football pool problem for six matches
cites work: On the size of optimal binary codes of length 9 and covering radius 1
cites work: Intersection Inequalities for the Covering Problem
cites work: Q4222123
cites work: Attacking the market split problem with lattice point enumeration
cites work: On the football pool problem for 6 matches: A new upper bound
cites work: The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
DOI: 10.1006/JCTA.2002.3260
description: scientific article; zbMATH DE number 1888408