The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The string guessing problem as a method to prove lower bounds on the advice complexity |
scientific article |
Statements
The string guessing problem as a method to prove lower bounds on the advice complexity (English)
0 references
6 October 2014
0 references
online algorithms
0 references
competitive analysis
0 references
advice complexity
0 references
online set cover
0 references
online clique
0 references
