An efficient algorithm to compute subsets of points in \(\mathbb Z^n\) (Q2900563)
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: An efficient algorithm to compute subsets of points in Z^n |
scientific article; zbMATH DE number 6059546
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm to compute subsets of points in \(\mathbb Z^n\) |
scientific article; zbMATH DE number 6059546 |
Statements
An Efficient Algorithm to Compute Subsets of Points in ℤ n (English)
0 references
23 July 2012
0 references
digital image
0 references
grid
0 references
hypercube
0 references
isometry
0 references
\(n\)-xel
0 references
0.7254996299743652
0 references
0.7230193018913269
0 references
0.7186922430992126
0 references
