The string guessing problem as a method to prove lower bounds on the advice complexity
Permanent link
https://doi.org/10.3929/ethz-a-010886762Publication status
publishedExternal links
Journal / series
Theoretical Computer ScienceVolume
Pages / Article No.
Publisher
ElsevierSubject
Online algorithms; Competitive analysis; Advice complexity; Online set cover; Online cliqueOrganisational unit
02150 - Dep. Informatik / Dep. of Computer Science03666 - Hromkovic, Juraj (emeritus) / Hromkovic, Juraj (emeritus)
More
Show all metadata
ETH Bibliography
yes
Altmetrics