An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem (Q2827805)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem |
scientific article |
Statements
An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem (English)
0 references
21 October 2016
0 references
0 references
