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 the normal view instead:
scientific article; zbMATH DE number 6760373
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for runtime complexity of term rewriting |
scientific article; zbMATH DE number 6760373 |
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
0.9383600950241088
0 references
0.8191729784011841
0 references
0.8107977509498596
0 references
0.8002203106880188
0 references
0.7775974869728088
0 references
