On the parameterized complexity of associative and commutative unification
type: Item
instance of: scholarly article
title: On the parameterized complexity of associative and commutative unification
zbMATH Open document ID: 1355.68108
author: Tatsuya Akutsu
author: Jesper Jansson
author: Atsuhiro Takasu
author: Takeyuki Tamura
published in: Theoretical Computer Science
publication date: 2016-12-22T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6668235
zbMATH Keywords: unification
zbMATH Keywords: parameterized algorithm
zbMATH Keywords: dynamic programming
zbMATH Keywords: tree edit distance
describes a project that uses: HOL90
describes a project that uses: BousiProlog
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.11.026
OpenAlex ID: W1514995304
cites work: On the computational power of pushdown automata
cites work: Combinatorial Pattern Matching
cites work: Unification theory
cites work: Complexity of matching problems
cites work: A survey on tree edit distance and related problems
cites work: The parameterized complexity of sequence alignment and consensus
cites work: Q3651735
cites work: About the Paterson-Wegman linear unification algorithm
cites work: Single elementary associative-commutative matching
cites work: Pattern matching with variables: a multivariate complexity analysis
cites work: Parametrized complexity theory.
cites work: Complexity of unification problems with associative-commutative operators
cites work: Unification: a multidisciplinary survey
cites work: Adventures in associative-commutative unification
cites work: Q3339245
cites work: Linear unification
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: A Unification Algorithm for Associative-Commutative Functions
DOI: 10.1016/J.TCS.2016.11.026
Recommended article: On the Parameterized Complexity of Associative and Commutative Unification
Recommended article: Complexity of unification problems with associative-commutative operators
Recommended article: On the complexity of Boolean unification
Recommended article: A note on the parallel complexity of anti-unification
Recommended article: Associative-commutative unification
Recommended article: Q3338216
Recommended article: Adventures in associative-commutative unification
Recommended article: Q3805960
Recommended article: An algebraic approach to unification under associativity and commutativity
Recommended article: Q3703287
description: scientific article; zbMATH DE number 6668235