The advice complexity of a class of hard online problems (Q1693995)
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 advice complexity of a class of hard online problems |
scientific article; zbMATH DE number 6833242
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The advice complexity of a class of hard online problems |
scientific article; zbMATH DE number 6833242 |
Statements
The advice complexity of a class of hard online problems (English)
0 references
1 February 2018
0 references
online algorithms
0 references
advice complexity
0 references
complexity class
0 references
asymmetric string guessing
0 references
covering designs
0 references
asymmetric online covering (AOC)
0 references
0.9817459583282472
0 references
0.8734078407287598
0 references
0.8714725375175476
0 references
0.8664662837982178
0 references
0.865845799446106
0 references
