COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE (Q3839875): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Oracle branching programs and Logspace versus \(P^*\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Alternation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complete problems for deterministic polynomial time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New problems complete for nondeterministic log space / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank | |||
Normal rank | |||
Latest revision as of 13:38, 28 May 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
