Advice complexity of online non-crossing matching (Q2678256)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Advice complexity of online non-crossing matching |
scientific article |
Statements
Advice complexity of online non-crossing matching (English)
0 references
9 January 2023
0 references
online algorithms
0 references
advice complexity
0 references
non-crossing matching in 2D
0 references
