On the parameterized complexity of \(d\)-dimensional point set pattern matching (Q2380044)
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: On the parameterized complexity of d-dimensional point set pattern matching |
scientific article; zbMATH DE number 5686475
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the parameterized complexity of \(d\)-dimensional point set pattern matching |
scientific article; zbMATH DE number 5686475 |
Statements
On the parameterized complexity of \(d\)-dimensional point set pattern matching (English)
0 references
24 March 2010
0 references
computational complexity
0 references
computational geometry
0 references
fixed parameter tractability
0 references
geometric point set matching
0 references
congruence
0 references
unbounded dimension
0 references
0.996734619140625
0 references
0.8197329044342041
0 references
0.8069307804107666
0 references
0.8032552003860474
0 references
