Pages that link to "Item:Q1865378"
From MaRDI portal
The following pages link to A new lower bound for the football pool problem for six matches (Q1865378):
Displaying 12 items.
- Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
- A new lower bound for the football pool problem for 7 matches (Q679112) (← links)
- Lower bounds for the football pool problem for 7 and 8 matches (Q872721) (← links)
- New upper bounds for the football pool problem for 11 and 12 matches (Q1331131) (← links)
- New results on codes with covering radius 1 and minimum distance \(2\) (Q1781002) (← links)
- A combinatorial proof for the football pool problem for six matches (Q1924246) (← links)
- New upper bounds for the football pool problem for 6, 7, and 8 matches (Q2277164) (← links)
- On the minimum size of 4-uniform hypergraphs without property \(B\) (Q2434735) (← links)
- Bounds for covering codes over large alphabets (Q2572977) (← links)
- Several new lower bounds for football pool systems (Q2713661) (← links)
- Improving bounds on the football pool problem by integer programming and high-throughput computing (Q2901077) (← links)
- An updated table of binary/ternary mixed covering codes (Q4736760) (← links)