A subspace covering problem in the \(n\)-cube (Q516772)
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: A subspace covering problem in the n-cube |
scientific article; zbMATH DE number 6695000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A subspace covering problem in the \(n\)-cube |
scientific article; zbMATH DE number 6695000 |
Statements
A subspace covering problem in the \(n\)-cube (English)
0 references
15 March 2017
0 references
packing
0 references
covering
0 references
dimension constraint
0 references
graph decomposition
0 references
0 references
0 references
0.7780169248580933
0 references
0.7754054665565491
0 references
0.7714036107063293
0 references
0.7682904005050659
0 references
0.7659676671028137
0 references
