On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching (Q3499735)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5282015
| 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 5282015 |
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
0.996734619140625
0 references
0.8141553997993469
0 references
0.8025954365730286
0 references
0.7999210357666016
0 references
