Algorithms and reductions for rewriting problems. II.
From MaRDI portal
Publication:1853144
DOI10.1016/S0020-0190(02)00395-2zbMath1042.68051MaRDI QIDQ1853144
Publication date: 21 January 2003
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tight complexity bounds for term matching problems
- Automated complexity analysis based on ordered resolution
- Deciding Combinations of Theories
- Fast Decision Procedures Based on Congruence Closure
- Variations on the Common Subexpression Problem
- Polynomial time termination and constraint satisfaction tests
- Automatic recognition of tractability in inference relations