Some complexity theoretic aspects of AC rewriting
From MaRDI portal
Publication:5096174
DOI10.1007/BFb0029003zbMath1492.68075OpenAlexW1606974244MaRDI QIDQ5096174
Rakesh M. Verma, I. V. Ramakrishnan
Publication date: 16 August 2022
Published in: STACS 89 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0029003
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)
Cites Work
- Matching is as easy as matrix inversion
- Subtree isomorphism is NC reducible to bipartite perfect matching
- Linear unification
- An Efficient Unification Algorithm
- An Analysis of a Good Algorithm for the Subtree Problem
- On Relating Time and Space to Size and Depth
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Some complexity theoretic aspects of AC rewriting