Lower bounds for runtime complexity of term rewriting (Q2398176): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10817-016-9397-x / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10817-016-9397-X / rank | |||
Normal rank | |||
Latest revision as of 09:40, 18 December 2024
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
