Lower bounds for runtime complexity of term rewriting (Q2398176)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower bounds for runtime complexity of term rewriting |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for runtime complexity of term rewriting |
scientific article |
Statements
Lower bounds for runtime complexity of term rewriting (English)
0 references
15 August 2017
0 references
complexity analysis
0 references
term rewriting
0 references
induction
0 references
lower bounds
0 references
0 references
