Complexity of acyclic term graph rewriting (Q5369475)
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 6792343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of acyclic term graph rewriting |
scientific article; zbMATH DE number 6792343 |
Statements
17 October 2017
0 references
program analysis
0 references
graph rewriting
0 references
complexity analysis
0 references
Complexity of Acyclic Term Graph Rewriting. (English)
0 references
0.8205274939537048
0 references
0.8065460324287415
0 references
0.7804455161094666
0 references
0.7774737477302551
0 references
