The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093)
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 string guessing problem as a method to prove lower bounds on the advice complexity |
scientific article; zbMATH DE number 6351428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The string guessing problem as a method to prove lower bounds on the advice complexity |
scientific article; zbMATH DE number 6351428 |
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
0.9902456
0 references
0.8879667
0 references
0.8689582
0 references
0.85806787
0 references
0.85806787
0 references
0.8439298
0 references
0.84363914
0 references
0.83810985
0 references
