New upper bounds for the football pool problem for 11 and 12 matches (Q1331131)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New upper bounds for the football pool problem for 11 and 12 matches |
scientific article; zbMATH DE number 617598
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New upper bounds for the football pool problem for 11 and 12 matches |
scientific article; zbMATH DE number 617598 |
Statements
New upper bounds for the football pool problem for 11 and 12 matches (English)
0 references
9 July 1995
0 references
upper bounds
0 references
covering codes
0 references
simulated annealing
0 references
minimizing the number of words in a code
0 references
Hamming distance 1
0 references
football pool problem
0 references
0.94045055
0 references
0.9273715
0 references
0.9189457
0 references
0.91468036
0 references
0.90990853
0 references
0.9079834
0 references
0.90096533
0 references
0.88041955
0 references
0.8768809
0 references
