On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching (Q3499735)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching |
scientific article |
Statements
On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching (English)
0 references
3 June 2008
0 references
Fixed Parameter Tractability
0 references
Geometric Point Set Matching
0 references
Congruence
0 references
Unbounded Dimension
0 references
