The STO-problem is NP-hard (Q1892125)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The STO-problem is NP-hard |
scientific article |
Statements
The STO-problem is NP-hard (English)
0 references
3 July 1995
0 references
occur-check
0 references
Martelli-Montanari unification algorithm
0 references
