On the parameterized complexity of associative and commutative unification (Q729894)
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 6668235
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the parameterized complexity of associative and commutative unification |
scientific article; zbMATH DE number 6668235 |
Statements
On the parameterized complexity of associative and commutative unification (English)
0 references
22 December 2016
0 references
unification
0 references
parameterized algorithm
0 references
dynamic programming
0 references
tree edit distance
0 references
0 references
0.9535699
0 references
0.88034946
0 references
0.87476903
0 references
0 references
0.87087315
0 references
0.8668534
0 references
