COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE (Q3839875): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:42, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE |
scientific article |
Statements
COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE (English)
0 references
20 January 2000
0 references
alternating Turing machine
0 references
tree automata
0 references
clone
0 references
term-equivalence
0 references
exponential time
0 references
