The STO-problem is NP-hard (Q1892125)
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: The STO-problem is NP-hard |
scientific article; zbMATH DE number 762009
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The STO-problem is NP-hard |
scientific article; zbMATH DE number 762009 |
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
0.9488813281059264
0 references
0.9453104734420776
0 references
0.9449102878570556
0 references
0.7317280769348145
0 references