The STO problem is NP-Hard
| Authors |
|
|---|---|
| Publication date | 1995 |
| Journal | Journal of Symbolic Computation |
| Volume | Issue number | 18 |
| Pages (from-to) | 489-495 |
| Organisations |
|
| Document type | Article |
| Published at | https://doi.org/10.1006/jsco.1994.1060 |
| Downloads | |
| Permalink to this page | |