Constant runtime complexity of term rewriting is semi-decidable (Q1799562)
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: Constant runtime complexity of term rewriting is semi-decidable |
scientific article; zbMATH DE number 6958538
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constant runtime complexity of term rewriting is semi-decidable |
scientific article; zbMATH DE number 6958538 |
Statements
Constant runtime complexity of term rewriting is semi-decidable (English)
0 references
19 October 2018
0 references
computational complexity
0 references
decidability
0 references
formal methods
0 references
program correctness
0 references
term rewriting
0 references
0.7861747145652771
0 references
0.7766309976577759
0 references
0.7569742798805237
0 references
0.7550147771835327
0 references
0.7467836141586304
0 references
