On the Parameterized Complexity of Associative and Commutative Unification

DOI10.1007/978-3-319-13524-3_2zbMath1456.68061arXiv1310.0919OpenAlexW2726068116MaRDI QIDQ2946004

Atsuhiro Takasu, Tatsuya Akutsu, Takeyuki Tamura, Jesper Jansson

Publication date: 15 September 2015

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.0919

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Unnamed Item
• A survey on tree edit distance and related problems
• Complexity of matching problems
• About the Paterson-Wegman linear unification algorithm
• Linear unification
• The parameterized complexity of sequence alignment and consensus
• Single elementary associative-commutative matching
• Parametrized complexity theory.
• Unification: a multidisciplinary survey
• Pattern Matching with Variables: A Multivariate Complexity Analysis
• A Machine-Oriented Logic Based on the Resolution Principle
• Combinatorial Pattern Matching

This page was built for publication: On the Parameterized Complexity of Associative and Commutative Unification