Lower bounds for runtime complexity of term rewriting (Q2398176): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:38, 2 February 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
